# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1247640 | wedonttalkanymore | Growing Vegetables is Fun 4 (JOI21_ho_t1) | C++20 | 13 ms | 4988 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define pii pair<ll, ll>
#define fi first
#define se second
const ll N = 2e5 + 5, inf = 1e18, mod = 1e9 + 7, block = 320, lim = 1 << 16;
int n, a[N];
int diff[N], diff1[N];
int pos[N], pos1[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
if (fopen(".inp", "r")) {
freopen(".inp", "r", stdin);
freopen(".out", "w", stdout);
}
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
diff[i] = diff[i - 1] + max(0LL, a[i - 1] - a[i] + 1);
}
for (int i = n; i >= 1; i--) {
diff1[i] = diff1[i + 1] + max(0LL, a[i + 1] - a[i] + 1);
}
int ans = inf;
for (int i = 1; i <= n; i++) {
ans = min(ans, max(diff[i], diff1[i]));
}
cout << ans;
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |