HDU 3127 WHUgirls

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>

#define MAX 1001
using namespace std;

struct cloth{
    int xi,yi,ci;
};
int dp[MAX][MAX]={0};

int main(){
    int T;
    cin >> T;
    while(T--){
        int N,X,Y;
        cin >> N>>X>>Y;
        vector<cloth> piece(N);
        for(int i = 0; i < N; i ++ )
            cin >> piece[i].xi>>piece[i].yi>>piece[i].ci;
       // int dp[MAX][MAX]={0};  //不知道为什么把dp放在里面会栈溢出
        memset(dp,0,sizeof(dp));
        for(int  i = 1; i <= X; i ++ ){
            for(int j  = 1; j <= Y; j ++ ){
                for(int k = 0; k < N; k ++ ){
                    int x = piece[k].xi, y = piece[k].yi, c = piece[k].ci;
                    if(i >= x && j >=y )
                        dp[i][j] = max(dp[i][j],max(dp[i-x][y]+dp[i][j - y],dp[x][j-y]+dp[i-x][j])+c);
                    swap(x,y);
                    if(i >=x && j >= y)
                        dp[i][j] = max(dp[i][j],max(dp[i-x][y]+dp[i][j - y],dp[x][j-y]+dp[i-x][j])+c);
                }
            }
        }
        cout<<dp[X][Y]<<endl;
    }
    return 0;
}