@[一之濑琴美](/space/show?uid=72408) STO
by Reaepita @ 2018-11-23 22:03:47
@[Harry_bh](/space/show?uid=19951) QAQ这不是教我LCT的巨佬吗
能帮帮我嘛QAQ
by 萌田薰子 @ 2018-11-23 22:05:42
@[一之濑琴美](/space/show?uid=72408) 题解不是有费用流的方法吗?
by Reaepita @ 2018-11-23 22:09:07
@[Harry_bh](/space/show?uid=19951) emm其实我还是不太清楚那个= =
灰溜溜地跑去认真描一下题解QAQ
by 萌田薰子 @ 2018-11-23 22:10:59
@[一之濑琴美](/space/show?uid=72408) 如果要我写的话,可能得明天了,现在在调BZOJ ALOEXT(我已将调了1h了)
by Reaepita @ 2018-11-23 22:13:40
@[Harry_bh](/space/show?uid=19951) 不用了Orz这个题目还是不至于麻烦您打一遍的
我乖乖地去调 祝dalao早日调完那道题OvO
by 萌田薰子 @ 2018-11-23 22:15:58
@[一之濑琴美](/space/show?uid=72408) 好的,被这道题给虐哭了
~~ ~ ~(>_<)~ ~~~
by Reaepita @ 2018-11-23 22:18:04
```cpp
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;
long long n,m;
long long f[2001][2001],w[1001],c[1001],v;
int main()
{
cin>>m>>n;
for(int i=1;i<=n;i++)
cin>>w[i]>>c[i];
for(int i=1;i<=n;i++)
for(int v=m;v>0;v--)
{
if(w[i]<=v) f[i][v]=max(f[i-1][v],f[i-1][v-w[i]]+c[i]);
else f[i][v]=f[i-1][v];
}
cout<<f[n][m];
return 0;
}
```
by HHBH @ 2018-12-20 20:29:45
@[ivwxy](/space/show?uid=94581) 麻烦自行了解什么是费用流。。。
by SSerxhs @ 2018-12-26 20:14:58
呵呵呵呵
by HHBH @ 2018-12-26 20:26:25