Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 14893 | Accepted: 6809 |
Description
Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the supplied list has a weightWi (1 ≤ Wi ≤ 400), a 'desirability' factor Di (1 ≤ Di ≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than M (1 ≤ M ≤ 12,880).
Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.
Input
* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: Wi and Di
Output
* Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints
Sample Input
4 6 1 4 2 6 3 12 2 7
Sample Output
23
Source
for(int i=1;i<=N;++i)
for(int j=0;j<=M;++j)
if(j>=weight[i])
f[i][j]=max(f[i-1][j],f[i-1][j-weight[i]]+value[i]);
else f[i][j]=f[i-1][j];
抱着侥幸的心理我提交了下,结果超内存了。算算消耗的空间为 12,880*3,402=43817760,我又开的int,每个占4字节,因此消耗的总内存约为17wkb,题目要求在6w kb以下,看来还得改进。
using namespace std;
#define MAXN 3403
int N,M, weight[MAXN], value[MAXN], f[12881];
int main()
{
while(cin>>N>>M)
{
for(int i=1;i<=N;++i)
cin>>weight[i]>>value[i];
memset(f,0,sizeof(f));
for(int i=1;i<=N;++i)
for(int j=M;j>=0;--j)
if(j>=weight[i])
f[j]=max(f[j],f[j-weight[i]]+value[i]);
cout<<f[M]<<endl;
}
return 0;
}