# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434307 | JovanK26 | Lightning Conductor (POI11_pio) | C++14 | 31 ms | 2252 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 <cstdio>
#include <cmath>
#include <cstdlib>
#define MAXIMUM(a,b) ((a)>(b)?(a):(b))
#define MAXN 100000
int N;
int H[MAXN],HMax,MAXind;
int main() {
scanf("%d", &N);
for(int i = 0; i < N; i++)
scanf("%d", &H[i]);
HMax = H[0]; MAXind = 0;
for(int i = 1; i < N; i++) {
if(H[i] > HMax) {
MAXind = i;
HMax = H[i];
}
}
for(int i = 0; i < N; i++)
printf("%d\n", HMax-H[i] + (int) ceil(sqrt(abs(MAXind-i))));
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |