100 Accepted
time_space_table: /1606/hay4sale.1.in:AC mem=2392k time=4ms /1606/hay4sale.10.in:AC mem=2392k time=11ms /1606/hay4sale.11.in:AC mem=2392k time=185ms /1606/hay4sale.2.in:AC mem=2392k time=3ms /1606/hay4sale.3.in:AC mem=2392k time=3ms /1606/hay4sale.4.in:AC mem=2392k time=3ms /1606/hay4sale.5.in:AC mem=2392k time=5ms /1606/hay4sale.6.in:AC mem=2392k time=4ms /1606/hay4sale.7.in:AC mem=2392k time=4ms /1606/hay4sale.8.in:AC mem=2392k time=6ms /1606/hay4sale.9.in:AC mem=2392k time=8ms /1606/haysale.1.in:AC mem=2392k time=4ms /1606/haysale.10.in:AC mem=2392k time=11ms /1606/haysale.11.in:AC mem=2392k time=180ms /1606/haysale.2.in:AC mem=2392k time=3ms /1606/haysale.3.in:AC mem=2392k time=4ms /1606/haysale.4.in:AC mem=2392k time=3ms /1606/haysale.5.in:AC mem=2392k time=3ms /1606/haysale.6.in:AC mem=2392k time=4ms /1606/haysale.7.in:AC mem=2392k time=5ms /1606/haysale.8.in:AC mem=2392k time=6ms /1606/haysale.9.in:AC mem=2392k time=9ms
代码
#include <iostream>
using namespace std;
int f[50010] = {1}, a[5010];
int m, n;
int main () {
cin >> m >> n;
for (int i = 1; i <= n; i ++) {
cin >> a[i];
}
for (int i = 1; i <= n; i ++) {
for (int j = m; j >= a[i]; j --) {
f[j] = max (f[j], f[j - a[i]]);
}
}
for (int i = m; i >= 1; i --) {
if (f[i]) {
cout << i << endl;
return 0;
}
}
return 0;
}
信息
- 递交者
- 题目
- P1606 [Usaco2008 Dec]Hay For Sale 购买干草
- 语言
- C++
- 代码长度
- 408 Bytes
- 递交时间
- 2022-12-3 21:16:40
- 评测时间
- 2023-12-17 23:47:31
- 分数
- 100
- 总耗时
- 468ms
- 峰值内存
- 2.3 MiB