codeforces 732B Cormen — The Best Friend Of a Man
2018-03-08 21:40
411 查看
题目:http://codeforces.com/problemset/problem/732/B
题目大意:Polycarp家的狗在相邻的两天内至少要遛k次,求在当前计划的基础上Polycarp最少还要多遛几次他的狗?
思路:将相邻两天遛狗的次数相加,如果次数少于k,就增加两天中的后一天的遛狗次数直至两天之和等于k即可
AC代码
题目大意:Polycarp家的狗在相邻的两天内至少要遛k次,求在当前计划的基础上Polycarp最少还要多遛几次他的狗?
思路:将相邻两天遛狗的次数相加,如果次数少于k,就增加两天中的后一天的遛狗次数直至两天之和等于k即可
AC代码
#include <iostream> #include <cmath> using namespace std; int main() { int n,m,k,a[501],sum=0; cin>>n>>m; for(int i=0;i<n;i++) { cin>>a[i]; sum+=a[i]; } for(int i=0;i<n;i++) { k=a[i]+a[i+1]; if(k<m) a[i+1]+=m-k; } for(int i=0;i<n;i++) sum-=a[i]; cout<<abs(sum)<<endl; for(int i=0;i<n;i++) cout<<a[i]<<" "; return 0; }
相关文章推荐
- codeforces 732B Cormen — The Best Friend Of a Man
- CodeForces 732B Cormen — The Best Friend Of a Man (贪心)
- CodeForces 732B Cormen — The Best Friend Of a Man
- CodeForces 732B Cormen — The Best Friend Of a Man
- CodeForces 732B Cormen — The Best Friend Of a Man(带着宠物轧马路)
- codeforces 732B Cormen — The Best Friend Of a Man (水题)
- Codeforces 732B Cormen — The Best Friend Of a Man【贪心】
- CodeForces 732B 之 Cormen — The Best Friend Of a Man
- Codeforces 732B-Cormen—The Best Friend Of a Man
- CodeForces 732B Cormen — The Best Friend Of a Man
- 【56.74%】【codeforces 732B】Cormen --- The Best Friend Of a Man
- codeforces 732B - Cormen --- The Best Friend Of a Man
- CodeForces 732 B.Cormen — The Best Friend Of a Man(贪心)
- CodeForces-732B-Cormen — The Best Friend Of a Man(简单模拟)
- 【codeforces 723 B Cormen — The Best Friend Of a Man】
- Codeforces Round #377 (Div. 2) B. Cormen — The Best Friend Of a Man(贪心)
- codeforce#377B. Cormen — The Best Friend Of a Man
- Codeforces Round #377 (Div. 2) B. Cormen — The Best Friend Of a Man(贪心)
- Cormen — The Best Friend Of a Man (贪心)
- codeforces732B Cormen — The Best Friend Of a Man(dp 贪心)