Codeforces Round #119 (Div. 2) / 189A Cut Ribbon (完全背包)
2013-08-29 21:19
357 查看
A. Cut Ribbon
http://codeforces.com/problemset/problem/189/A
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions:
After the cutting each ribbon piece should have length a, b or c.
After the cutting the number of ribbon pieces should be maximum.
Help Polycarpus and find the number of ribbon pieces after the required cutting.
Input
The first line contains four space-separated integers n, a, b and c (1 ≤ n, a, b, c ≤ 4000) —
the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can
coincide.
Output
Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists.
Sample test(s)
input
output
input
output
Note
In the first example Polycarpus can cut the ribbon in such way: the first piece has length 2, the second piece has length 3.
In the second example Polycarpus can cut the ribbon in such way: the first piece has length 5, the second piece has length 2.
完全背包裸题。
完整代码:
http://codeforces.com/problemset/problem/189/A
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions:
After the cutting each ribbon piece should have length a, b or c.
After the cutting the number of ribbon pieces should be maximum.
Help Polycarpus and find the number of ribbon pieces after the required cutting.
Input
The first line contains four space-separated integers n, a, b and c (1 ≤ n, a, b, c ≤ 4000) —
the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can
coincide.
Output
Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists.
Sample test(s)
input
5 5 3 2
output
2
input
7 5 5 2
output
2
Note
In the first example Polycarpus can cut the ribbon in such way: the first piece has length 2, the second piece has length 3.
In the second example Polycarpus can cut the ribbon in such way: the first piece has length 5, the second piece has length 2.
完全背包裸题。
完整代码:
/*30ms,0KB*/ #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int n, a[3]; int f[5010]; int main(void) { int i, j; scanf("%d%d%d%d", &n, &a[0], &a[1], &a[2]); memset(f, -1, sizeof(f)); f[0] = 0; for (i = 0; i < 3; i++) { int m = n - a[i]; for (j = 0; j <= m; j++) if (~f[j])///小优化 f[j + a[i]] = max(f[j + a[i]], f[j] + 1); } printf("%d", f ); return 0; }
相关文章推荐
- Codeforces Round #119 (Div. 2) A题
- Codeforces Round #158 (Div. 2) (完全)
- Codeforces Round #161 (Div. 2)(完全)
- Codeforces Round #419 (Div. 1) C. Karen and Supermarket(树上背包)
- codeforces round 119 div2 A-D
- Codeforces Round #119 (Div. 2) B. Counting Rhombi
- Codeforces Round #360 (Div. 2) E dp 类似01背包
- Codeforces Round #119 (Div. 2) A. Cut Ribbon
- Codeforces Round #119 (Div. 2)A. Cut Ribbon
- Educational Codeforces Round 39 (Rated for Div. 2) codeforces946 D. Timetable-数据处理+分组背包(处理炸裂)
- 【Codeforces Round 333 (Div 2)C】【最短路】The Two Routes 完全图两种双向边的最小最大距离
- Codeforces Round #119 (Div. 1) B. AlgoRace
- Codeforces Round #119 (Div. 2) Cut Ribbon(DP)
- Codeforces Round #142 (Div. 1) C. Triangles 数学,完全图,统计贡献 2017/1/25
- Codeforces Round #163 (Div. 2)(完全)
- codeforces round#322 div2 F (树形背包)
- Educational Codeforces Round 39 (Rated for Div. 2) D. Timetable (背包)
- Codeforces Round #419 (Div. 2)-树形dp&依赖背包&-E. Karen and Supermarket
- Codeforces Round #142 (Div. 1) (完全)
- Codeforces Round #212 (Div. 2)(完全)