# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
761558 | 2023-06-20T03:10:44 Z | KN200711 | Skyline (IZhO11_skyline) | C++14 | 1 ms | 212 KB |
# include <bits/stdc++.h> # define ll long long # define fi first # define se second using namespace std; int main() { int N; scanf("%d", &N); vector<int> arr(N); for(int i=0;i<N;i++) scanf("%d", &arr[i]); bool ls = 1; int ans = 0; while(ls) { ls = 0; for(int c=0;c<N;c++) { if(arr[c] == 0) continue; ls = 1; int mn = 1e9, cnt = 0; for(int d=c;d<N && arr[d];d++) { cnt++; mn = min(mn, arr[d]); } for(int d=c;d<N && arr[d];d++) { arr[d] -= mn; } ans += (2 * cnt + 1) * mn; break; } } printf("%d\n", ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Incorrect | 1 ms | 212 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |