제출 #769955

#제출 시각아이디문제언어결과실행 시간메모리
769955raysh07Growing Vegetables is Fun 4 (JOI21_ho_t1)C++17
100 / 100
22 ms5408 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define INF (int)1e18 #define f first #define s second mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count()); void Solve() { int n; cin >> n; vector <int> a(n), d(n); int a1 = 0, a2 = 0; for (int i = 0; i < n; i++){ cin >> a[i]; if (i != 0) { d[i] = a[i] - a[i - 1]; d[i] = -d[i]; if (d[i] <= 0) a1 += 1 - d[i]; } } int ans = a1; for (int i = 1; i < n; i++){ int x = d[i]; if (x <= 0) a1 -= 1 - x; if (x >= 0) a2 += 1 + x; // cout << a1 << " " << a2 << "\n"; ans = min(ans, max(a1, a2)); } cout << ans << "\n"; } int32_t main() { auto begin = std::chrono::high_resolution_clock::now(); ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; // cin >> t; for(int i = 1; i <= t; i++) { //cout << "Case #" << i << ": "; Solve(); } auto end = std::chrono::high_resolution_clock::now(); auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin); cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...