洛谷p1064 金明的预算方法

#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;

const int MAXV = 32005;
const int MAXN = 65;

int dp[MAXV];
int p[MAXN], q[MAXN], v[MAXN];
int N, M;

void slv()
{
    memset(dp, 0, sizeof(dp));
    bool k1, k2;
    int t1, t2;

    for(int i = 1; i <= N; i++)
    {
        t1 = t2 = 0;
        k1 = k2 = false;
        if(q[i] == 0)
        {
            k1 = k2 = false;
            for(int k = i+1; k <= N; k++)
            {
                if(q[k] == i)
                {
                    t1 = k;
                    k1 = true;
                    break;
                }
            }

            for(int k = t1+1; k <= N; k++)
            {
                if(q[k] == i)
                {
                    t2 = k;
                    k2 = true;
                    break;
                }
            }

            for(int s = M; s >= v[i]; s--)
            {
                dp[s] = max(dp[s], dp[s-v[i]] + v[i]*p[i]);

                if(s-v[i]-v[t1] >= 0 && k1)
                {
                    dp[s] = max(dp[s], dp[s-v[i]-v[t1]] + v[i]*p[i] + v[t1]*p[t1]);
                }
                if(s-v[i]-v[t2] >= 0 && k2)
                {
                    dp[s] = max(dp[s], dp[s-v[i]-v[t2]] + v[i]*p[i] + v[t2]*p[t2]);
                }
                if(s-v[i]-v[t1]-v[t2] >= 0 && k1 && k2)
                {
                    dp[s] = max(dp[s], dp[s-v[i]-v[t1]-v[t2]] + v[i]*p[i] + v[t1]*p[t1] + v[t2]*p[t2]);
                }
            }
        }
    }

    printf("%d\n", dp[M]);

}

int main()
{
    scanf("%d%d", &M, &N);

    for(int i = 1; i <= N; i++)
        scanf("%d%d%d", &v[i], &p[i], &q[i]);

    slv();

    return 0;
}