Submission #167429

#TimeUsernameProblemLanguageResultExecution timeMemory
167429ThuleanxLightning Conductor (POI11_pio)C++14
81 / 100
1068 ms20272 KiB
#include <bits/stdc++.h>
using namespace std;

int n;

vector<int> solve(vector<int> &h) {
	vector<int> ans(n), mi(n, 0);
	int hi = 0;
	for (int i = 0; i < n; i++) {
		hi = max(hi, mi[i]);
		ans[i] = max(0, hi - h[i]);
		for (int j = 0; i + j*j + 1 < n; j++)
			mi[i+j*j+1] = max(mi[i + j*j + 1], h[i] + j + 1);
	}
	return ans;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	cin>>n;

	vector<int> h(n);
	for (int i = 0; i < n; i++)
		cin >> h[i];
	vector<int> ans = solve(h);
	reverse(h.begin(), h.end());
	vector<int> ans2 = solve(h);
	reverse(ans2.begin(), ans2.end());
	stringstream ss;
	for (int i = 0; i < n; i++)
		ss << max(ans[i], ans2[i]) << endl;
	cout << ss.str();

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...