Link
解题思路
竟是大贪心
设qian[i]为k = i时,左边需要浇多少水,hou[]意义类似
最后答案枚举i,去最小的max(qian[i],hou[i])
证明正确性
(本蒟蒻不太会,只能拿数据说明)
比如最后一个数据,以6为k,qian[6]=93,hou[6]=57
Code
#include <iostream>
#include <cstdio>
#define ll long long
using namespace std;
int n;
ll ans = 1e18;
ll c[200200], a[200200], b[200200], qian[200200], hou[200200];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
for(int i = 2; i <= n; i++) {
qian[i] = qian[i - 1];
if(a[i] <= a[i - 1])
qian[i] += (a[i - 1] - a[i]) + 1; //需要浇多少水
}
for(int i = n - 1; i; i--) {
hou[i] = hou[i + 1];
if(a[i + 1] >= a[i])
hou[i] += (a[i + 1] - a[i]) + 1;
}
for(int i = 1; i <= n; i++)
ans = min(ans, max(qian[i], hou[i]));
printf("%lld", ans);
}