# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1077303 | 2024-08-27T05:03:58 Z | quangminh412 | Growing Vegetables is Fun 4 (JOI21_ho_t1) | C++14 | 3 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; /* John Watson https://codeforces.com/profile/quangminh98 Mua Code nhu mua Florentino !! */ #define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define ll long long const int maxn = 2e5 + 9; const ll oo = 1e18; int n; int a[maxn]; int b[maxn]; int solve(int pos) { int ans1 = 0; int ans2 = 0; for (int i = 1; i <= pos; i++) ans1 += max(0, 1 - b[i]); for (int i = pos + 1; i <= n; i++) ans2 += max(0, 1 + b[i]); return max(ans1, ans2); } signed main() { if (fopen("test.inp", "r")) { freopen("test.inp", "r", stdin); freopen("test.out", "w", stdout); } faster(); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; b[i] = a[i] - a[i - 1]; } int res = 1e9; for (int i = 1; i <= n; i++) res = min(res, solve(i)); cout << res << '\n'; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Incorrect | 3 ms | 348 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Incorrect | 3 ms | 348 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |