codeforces 732B The Best Friend Of a Man 贪心
2016-11-18 17:32
405 查看
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #define inf 0x3f3f3f3f #define LL long long using namespace std; /************************************************ designer:hl time:2016/11/18 Exe.Time:15 ms Exe.Memory:0 KB 题目链接:http://codeforces.com/problemset/problem/732/B 题意:遛狗 每两天要遛至少k次 现在有一个遛狗计划,问要满足上面条件的话需要至少加多少次 题解:虽然标签里面有dp 其实直接简单贪心就搞定了 直接在第二天加前一天和这一天差的遛狗次数。就可以得到最优解 ************************************************/ using namespace std; int main() { int i, j, k, l, m, n; int a[555], ans = 0; scanf("%d%d", &n, &m); for (i = 0; i < n; i++) { scanf("%d", &a[i]); } for (i = 1; i < n; i++) { if (a[i - 1] + a[i] < m) { int t = m - a[i] - a[i - 1]; ans = ans + t; a[i] += t; } } printf("%d\n", ans); for (i = 0; i < n - 1; i++) { printf("%d ", a[i]); } printf("%d\n", a[n - 1]); return 0; }
相关文章推荐
- 贪心-Codeforces 777B
- Codeforces 556D Case of Fugitive【排序+贪心】
- codeforces 733C Epidemic in Monstropolis 贪心
- codeforces - 735B - Urbanization(贪心)
- Codeforces 435B Pasha Maximizes(贪心)
- codeforces 798 D. Mike and distribution 二维贪心
- 【CodeForces 628C 】Bear and String Distance (贪心)
- 【字典树】【贪心】Codeforces 706D Vasiliy's Multiset
- codeforces 469D. Two Sets(贪心or并查集)
- CodeForces 645 E.Intellectual Inquiry(dp+贪心)
- codeforces 332C Students' Revenge 贪心
- CodeForces 596B Wilbur and Array 贪心
- codeforces 748D Santa Claus and a Palindrome (构造+贪心+数据结构)
- Codeforces 553D Nudist Beach 优先队列 贪心
- CodeForces 712C Memory and De-Evolution(贪心+数学)
- Codeforces 600C Make Palindrome 【贪心 找字典序最小回文串】
- Codeforces 913D - Too Easy Problems(贪心+优先队列)
- Codeforces 758D 贪心
- Codeforces 509C. Sums of Digits 贪心 + 模拟
- codeforces 352 div 2 C.Recycling Bottles 贪心