Kiritow
/
OJ-Problems-Source
mirror of https://github.com/Kiritow/OJ-Problems-Source
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Create 1313_hzwer.cpp 

From http://hzwer.com/194.html
pull/18/head^2
Kirigaya Kazuto 2016-05-24 15:05:50 +08:00
parent fbaa2620f0
commit 3ad10ffa22
1 changed files with 35 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
VIJOS/1313_hzwer.cpp Normal file
View File

@ -0,0 +1,35 @@
#include<iostream>
using namespace std;
int main()
{
int a,b,mx=0;
int i,j;
int m,n,v[61]={0},p[61]={0},q;
int v1[61]={0},v2[61]={0},p1[61]={0},p2[61]={0};
int f[50001]={0};
cin>>m>>n;
m/=10;
for(i=1;i<=n;i++)
{
cin>>a>>b>>q;
a/=10;
if(q!=0)
{
if(v1[q]==0){v1[q]=a;p1[q]=b;}
else {v2[q]=a;p2[q]=b;}
}
else {v[i]=a;p[i]=b;}
}
for(int i=1;i<=n;i++)
for(int j=m;j>=v[i];j--)
{
f[j]=max(f[j],f[j-v[i]]+v[i]*p[i]);
if(j-v1[i]-v[i]>=0)f[j]=max(f[j],f[j-v1[i]-v[i]]+v1[i]*p1[i]+v[i]*p[i]);
if(j-v2[i]-v[i]>=0)f[j]=max(f[j],f[j-v2[i]-v[i]]+v2[i]*p2[i]+v[i]*p[i]);
if(j-v1[i]-v2[i]-v[i]>=0)f[j]=max(f[j],f[j-v1[i]-v2[i]-v[i]]+v1[i]*p1[i]+v2[i]*p2[i]+v[i]*p[i]);
mx=max(f[j],mx);
}
cout<<mx*10;
//system("pause");
return 0;
}