Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.072 s | 14 KBi |
#2 |
Error de compilación
Compilation time limit exceeded. |
||
#3 |
Correcto
|
0.08 s | 25 KBi |
#4 |
Error de compilación
Compilation time limit exceeded. |
||
#5 |
Error de compilación
Compilation time limit exceeded. |
||
#6 |
Error de compilación
Compilation time limit exceeded. |
||
#7 |
Error de compilación
Compilation time limit exceeded. |
||
#8 |
Correcto
|
0.072 s | 10 KBi |
#9 |
Error de compilación
Compilation time limit exceeded. |
||
#10 |
Error de compilación
Compilation time limit exceeded. |
||
#11 |
Correcto
|
0.081 s | 16 KBi |
#12 |
Error de compilación
Compilation time limit exceeded. |
||
#13 |
Error de compilación
Compilation time limit exceeded. |
||
#14 |
Correcto
|
0.311 s | 36 KBi |
#15 |
Correcto
|
0.314 s | 34 KBi |
#16 |
Correcto
|
0.309 s | 35 KBi |
#17 |
Correcto
|
0.338 s | 35 KBi |
#18 |
Correcto
|
0.322 s | 36 KBi |
#19 |
Correcto
|
0.361 s | 43 KBi |
#20 |
Correcto
|
0.402 s | 42 KBi |
import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws Exception { BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); for (String ln; (ln = in.readLine()) != null; ) { int N = Integer.parseInt(ln); int[] arr = new int[N]; StringTokenizer st = new StringTokenizer(in.readLine()); for (int i = 0; i < N; ++i) { arr[i] = Integer.parseInt(st.nextToken()); if (i > 0) { arr[i] += arr[i - 1]; } } StringBuilder sb = new StringBuilder(); for (int i = 1; i < N; ++i) { if(arr[i-1] > 0 && arr[N-1] - arr[i-1] < 0){ sb.append(i).append("\n"); break; } } if(sb.length() == 0) sb.append("Impossible\n"); System.out.print(new String(sb)); } } }