| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
1276....为什么WA了??大牛帮忙看一下啦。。谢!!#include<iostream>#include<iostream>
using namespace std;
int i=0,te=0,tesize,demin,dk[1000001],dp[100001];
int main(){
int sumbag,N;
while(cin>>sumbag>>N)
{
if(sumbag==0||N==0)
{
cout<<"0"<<endl;
continue;
}
for(int j=0;j<N;j++)
{
cin>>tesize>>demin;
for(int k=i;k<i+tesize;k++)
{
dk[k]=demin;
te=k;
}
i=te;
}
for(int j=0;j<=sumbag;j++)
if(j>=dk[i-1]) dp[j]=dk[i-1];
else dp[j]=0;
for(int j=i-2;j>=0;j--)
for(int k=0;k<=sumbag;k++)
if(k-dk[j]>0&&dp[k]<dp[k-dk[j]]+dk[j]) dp[k]=dp[k-dk[j]]+dk[j];
cout<<dp[sumbag]<<endl;
}
system("pause");
return 0;
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator