2025CSP-S模拟赛58 比赛总结

2025CSP-S模拟赛58

T1	T2	T3	T4
5 WA	100 AC	20 WA	75 TLE

总分：200；排名：6/25。

不知道为什么又在无意义罚坐。真的是把最显然的那一档打完之后就啥也不会做了，啥也想不出来。

除了 T2 是签到题，别的都是暴力。T4 应该是 45pts，数据水多了 30，T1 是骗分。

T1 铁轨

T2 参加

签到题

#include <bits/stdc++.h>
#define il inline
#define int long long

using namespace std;

const int bufsz = 1 << 20;
char ibuf[bufsz], *p1 = ibuf, *p2 = ibuf;
#define getchar() (p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, bufsz, stdin), p1 == p2) ? EOF : *p1++)
il int read() {
	int x = 0; char ch = getchar(); bool t = 0;
	while (ch < '0' || ch > '9') {t ^= ch == '-'; ch = getchar();}
	while (ch >= '0' && ch <= '9') {x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar();}
	return t ? -x : x;
}
bool Beg;
const int INF = 0x3f3f3f3f3f3f3f3f;
const int N = 2e5 + 10;
int n, a[N];
int f[N], g[N];

bool End;
il void Usd() {cerr << "\nUse: " << (&Beg - &End) / 1024.0 / 1024.0 << "MB " << (double)clock() * 1000.0 / CLOCKS_PER_SEC << "ms\n";}
signed main() {
	n = read();
	for (int i = 1; i <= n; i++) {
		a[i] = read();
	}
	for (int i = 2; i <= n; i++) {
		f[i] = f[i - 1] + max(0ll, a[i - 1] - a[i] + 1);
	}
	for (int i = n - 1; i >= 1; i--) {
		g[i] = g[i + 1] + max(0ll, a[i + 1] - a[i] + 1);
	}
	int ans = INF;
	for (int i = 1; i <= n; i++) {
		ans = min(ans, max(f[i], g[i]));
	}
	printf("%lld\n", ans);
	Usd();
	return 0;
}

T3 决斗

T4 回文串问题