| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 758319 | KN200711 | Skyline (IZhO11_skyline) | C++14 | 1 ms | 212 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
# 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;d++) {
				if(arr[d] == 0) break;
				cnt++;
				mn = min(mn, arr[d]);
			}
			for(int d=c;d<N;d++) {
				if(arr[d] == 0) break;
				arr[d] -= mn;
			}
			ans += (2 * cnt + 1) * mn;
		}
	}
	printf("%d\n", ans);
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
