题目1453：Greedy Tino（dp题目）

题目链接：http://ac.jobdu.com/problem.php?pid=1453

详解链接：https://github.com/zpfbuaa/JobduInCPlusPlus

参考代码：

//
//  1453 Greedy Tino.cpp
//  Jobdu
//
//  Created by PengFei_Zheng on 24/04/2017.
//  Copyright © 2017 PengFei_Zheng. All rights reserved.
//

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <cmath>
#include <limits.h>
#define MAX_SIZE 101
#define OFFSET 2000

using namespace std;

int t, n;
int weight[MAX_SIZE];
int dp[MAX_SIZE][];

int main(){
    scanf("%d",&t);
    int kase = ;
    while(t--){

        memset(weight, , sizeof(weight));
        scanf("%d",&n);
        bool haveZero = false;
        int num = ;//weight is not zero
        for(int i =  ; i <= n ; i++){
            scanf("%d",&weight[++num]);
            if(weight[num]==){
                num--;
                haveZero=true;
            }

        }
        n = num;
        for(int i = - ; i <= ; i++){
            dp[][i+OFFSET]=-INT_MAX;
        }
        dp[][+OFFSET]=;
        for(int i =  ; i <= n ; i++){
            for(int j = - ; j <=  ; j++){
                int tmp = -INT_MAX;
                if(j+weight[i]<= && dp[i-][j+weight[i]+OFFSET]!=-INT_MAX){
                    tmp = dp[i-][j+weight[i]+OFFSET]+weight[i];
                }
                if(j-weight[i]>=- && dp[i-][j-weight[i]+OFFSET]!=-INT_MAX){
                    tmp = max(tmp,dp[i-][j-weight[i]+OFFSET]+weight[i]);
                }
                tmp = max(tmp,dp[i-][j+OFFSET]);
                dp[i][j+OFFSET] = tmp;
            }
        }
        printf("Case %d: ",++kase);
        if(dp[n][+OFFSET]==){
            haveZero == true ? printf("0\n") : printf("-1\n");
        }
        else{
            printf("%d\n",dp[n][+OFFSET]/);
        }
    }
    return ;
}
/**************************************************************
    Problem: 1453
    User: zpfbuaa
    Language: C++
    Result: Accepted
    Time:20 ms
    Memory:3096 kb
****************************************************************/