USACO3.1.2 Score Inflation (inflate)

普通dp问题，dp[i]记录时间为i时最大分数

/*ID:xsy97051LANG:C++TASK:inflate*/#include <iostream>#include <cstdio>#include <cstring>using namespace std;int dp[10000];int main(){freopen("inflate.in","r",stdin);freopen("inflate.out","w",stdout);memset(dp,0,sizeof(dp));int t,m;    cin>>t>>m;    for(int i=1;i<=m;i++)    {        int time,score;cin>>score>>time;        for(int j=time;j<=t;j++)            dp[j]=max(dp[j],dp[j-time]+score);    }    cout<<dp[t]<<endl;    return 0;}