이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
import java.util.*;
public class pio {
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;
}
}
# | 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... |