설탕 배달 (dp)

https://www.acmicpc.net/problem/2839

2839번: 설탕 배달

 

• n=4일때 고려 안해서 틀렸다

 

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;

int main()
{
    int N;
    cin >> N;

    vector<int> dp(N+1);

    dp[0] = 99999;
    dp[1] = 99999;
    dp[2] = 99999;
    dp[3] = 1;
    dp[4] = 99999;
    dp[5] = 1;

    for(int i=6; i <= N; i++)
    {
        dp[i] = min(dp[i-3] + 1, dp[i-5] + 1);
    }

    if(dp[N] > 99999)cout << "-1";
    else if(N==4)cout << "-1";
    else cout << dp[N];
}