# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
757500 | vjudge1 | Lightning Conductor (POI11_pio) | Java | 0 ms | 0 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.
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
ArrayList<Integer> arr = new ArrayList<Integer>();
for (int i=0; i<n; i++){
arr.add(s.nextInt());
}
for (int i=0; i<n; i++){
System.out.println(operate(n, i, arr));
}
}
public static int operate(int n, int ind, ArrayList<Integer> arr){
int min = 0;
int hi = arr.get(ind);
for (int i=0; i<n; i++){
if (n == ind){ continue; }
int a = (int) Math.ceil(Math.sqrt(Math.abs(ind-i))) + arr.get(i) - hi;
if (a>min){
min = a;
}
}
return min;
}
}