Codeforces Round #119 (Div. 2) Cut Ribbon(DP)
2017-07-23 20:59
841 查看
[b]Cut Ribbon[/b]
time limit per test
1 second
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.
Examples
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.
【题意】给你一根绳子称为d,现在要将绳子分成若干段,使得每一段的长度必须是a,b,c中的一个,求分得的最多段数。
【分析】简单DP,dp[i]代表切到当前位置获得的最大段数,慢慢更新即可。
time limit per test
1 second
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.
Examples
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.
【题意】给你一根绳子称为d,现在要将绳子分成若干段,使得每一段的长度必须是a,b,c中的一个,求分得的最多段数。
【分析】简单DP,dp[i]代表切到当前位置获得的最大段数,慢慢更新即可。
#include <bits/stdc++.h> #define pb push_back #define mp make_pair #define vi vector<int> #define inf 0x3f3f3f3f using namespace std; typedef long long LL; const int N = 1e5+50; int n; int a,b,c; int dp ; void solve(int i,int x){ if(i-x==0)dp[i]=max(dp[i],1); else if(i-x<0)dp[i]=max(dp[i],0); else dp[i]=max(dp[i],dp[i-x]==0?0:dp[i-x]+1); } int main(){ scanf("%d%d%d%d",&n,&a,&b,&c); for(int i=1;i<=n;i++){ solve(i,a); solve(i,b); solve(i,c); } printf("%d\n",dp ); return 0; }
相关文章推荐
- Codeforces Round #277.5(Div. 2) F. Special Matrices【思维+Dp】好题~好题~
- 【Codeforces Round 331 (Div 2)D】【DP 记忆化搜索 期望DP区间性质 好题】Wilbur and Trees 砍树随机从右从左概率左倒右倒的期望底面覆盖长度
- Codeforces Round #343 (Div. 2) C. Famil Door and Brackets(dp)
- Codeforces Round #360 (Div. 1) C. The Values You Can Make(DP)
- Codeforces Round #264 (Div. 2)D(图论+dp)
- Codeforces Round #396(Div. 2)C. Mahmoud and a Message【dp】
- Codeforces Round #317 [AimFund Thanks-Round] (Div. 1) B. Minimization 贪心 dp
- Codeforces Round #274 Div.1 C Riding in a Lift --DP
- codeforces round# 302 (div1 C) (状压dp)
- Codeforces Round #106(Div. 2) 149D. Coloring Brackets 区间DP 记忆化搜索
- Codeforces Round #313 (Div. 1) C - Gerald and Giant Chess dp
- Codeforces Round #360 (Div. 2) E. The Values You Can Make DP
- Codeforces Round #260 (Div. 1) 455 A. Boredom (DP)
- Codeforces Round #Pi (Div. 2)567C Geometric Progression(dp + map)
- Codeforces Round #302 (Div. 2) C 简单dp
- Codeforces Round #319 (Div. 2)B. Modulo Sum(数学,DP)
- Codeforces Round #274 (Div. 2) E:Riding in a Lift DP + 前缀优化
- Codeforces Round #360 (Div. 2) E The Values You Can Make(DP)
- codeforces round 362 div2 D Puzzles 树形dp + 期望
- Codeforces Round #271 (Div. 2) E. Pillars 线段树优化dp