CodeForces 732B Cormen — The Best Friend Of a Man (贪心)
The of Codeforces 贪心 Best man
2023-09-11 14:17:18 时间
题意:给定n和k表示,狗要在任意连续两天散步次数要至少为k,然后就是n个数,表示每天的时间,让你增加最少次数使得这个条件成立。
析:贪心,策略是从开始到最后暴力,每次和前面一个相比,如果相加不够k,那么就给当前加上差。
代码如下:
#pragma comment(linker, "/STACK:1024000000,1024000000") #include <cstdio> #include <string> #include <cstdlib> #include <cmath> #include <iostream> #include <cstring> #include <set> #include <queue> #include <algorithm> #include <vector> #include <map> #include <cctype> #include <cmath> #include <stack> #define freopenr freopen("in.txt", "r", stdin) #define freopenw freopen("out.txt", "w", stdout) using namespace std; typedef long long LL; typedef pair<int, int> P; const int INF = 0x3f3f3f3f; const double inf = 0x3f3f3f3f3f3f; const double PI = acos(-1.0); const double eps = 1e-8; const int maxn = 500 + 5; const int mod = 1e9 + 7; const int dr[] = {-1, 1, 0, 0}; const int dc[] = {0, 0, 1, -1}; const char *de[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"}; int n, m; const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; inline int Min(int a, int b){ return a < b ? a : b; } inline int Max(int a, int b){ return a > b ? a : b; } inline LL Min(LL a, LL b){ return a < b ? a : b; } inline LL Max(LL a, LL b){ return a > b ? a : b; } inline bool is_in(int r, int c){ return r >= 0 && r < n && c >= 0 && c < m; } int a[maxn]; int main(){ while(scanf("%d %d", &n, &m) == 2){ for(int i = 0; i < n; ++i) scanf("%d", a+i); int ans = 0; for(int i = 1; i < n; ++i){ ans += Max(0, m - a[i] - a[i-1]); a[i] = Max(a[i], m - a[i-1]); } printf("%d\n", ans); for(int i = 0; i < n; ++i){ if(i) putchar(' '); printf("%d", a[i]); } printf("\n"); } return 0; }
相关文章
- 【异常】The dependencies of some of the beans in the application context form a cycle
- [Next.js] Hide Sensitive Information from the Consumers of Next.js API
- [Jest] Restore the Original Implementation of a Mocked JavaScript Function with jest.spyOn
- [Regular Expressions] Find the Start and End of Whole Words
- 整合zuul启动时报错Correct the classpath of your application so that it contains a single, compatible version of XXX
- python paramiko ssh.exec_command()启动tomcat服务器应用进程失败问题解决方法- Neither the JAVA_HOME nor the JRE_HOME environment variable is defined At least one of these environment variable is needed to run this progr
- OPA 16 - how is mocked transaction types loaded in the runtime
- SAP Spartacus UI Duplicated keys has been found in the config of i18n chunks
- 【Codeforces Round #502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) D】The Wu
- 【codeforces 602E】Kleofáš and the n-thlon
- 解决 fatal: Not a git repository (or any of the parent directories): .git 问题
- The resource could not be loaded because the App Transport Security policy requires the use of a sec
- iOS 打包上传时报错its private key is not installed.to get a copy of the private key
- 已解决The conversion of the nvarchar value ‘10033121171441‘ overflowed an int column
- 已解决WARNING: There was an error checking the latest version of pip.
- The size of tensor a (4) must match the size of tensor b (3) at non-singleton dimension 0
- The encryption certificate of the relying party trust identified by thumbprint is not valid
- 魔戒 (The Lord of the Rings,又译《指环王》)
- 编译webrtc报错:ERROR: The installation of the Chrome OS default fonts failed.
- 数学原理(The Principles of Mathmatics)
- 存在隐患 : 3 racks are required for the erasure coding policies: RS-6-3-1024k. The number of racks is on
- Sentinel采用SphO方式定义资源,报错:The order of entry exit can‘t be paired with the order of entry
- 【Transformer】6、Twins:Revisiting the Design of Spatial Attention in Vision Transformers
- 【异常】Flink整合ES出错,The implementation of the provided ElasticsearchSinkFunction is not serializable.