|Tyvj|NOIP2005|动态规划|P1005 采药

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main ()
{
const int maxt = 1000 + 5;
int t,m;
scanf("%d%d", &t,&m);
int f[maxt];
memset(f, 0, sizeof(f));
for (int i=1;i<=m;i++)
{
int time,v;
scanf("%d%d", &time, &v);
for (int j=t;j>=0;j--)
{
if (j>=time) f[j] = max(f[j], f[j-time]+v);
}
}
printf("%d\n", f[t]);
return 0;
}