Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.136 s | 14 KBi |
#2 |
Correcto
|
0.146 s | 13 KBi |
#3 |
Correcto
|
0.106 s | 17 KBi |
#4 |
Correcto
|
0.133 s | 13 KBi |
#5 |
Correcto
|
0.124 s | 12 KBi |
#6 |
Correcto
|
0.162 s | 16 KBi |
#7 |
Correcto
|
0.162 s | 16 KBi |
#8 |
Correcto
|
0.575 s | 42 KBi |
#9 |
Tiempo límite excedido
|
1.016 s | 59 KBi |
#10 |
Tiempo límite excedido
|
1.14 s | 66 KBi |
#11 |
Correcto
|
0.829 s | 122 KBi |
#12 |
Correcto
|
0.918 s | 123 KBi |
#13 |
Tiempo límite excedido
|
1.149 s | 82 KBi |
#14 |
Tiempo límite excedido
|
1.019 s | 95 KBi |
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int[] a = new int[n]; for (int i = 0; i < n; i++) { a[i] = scanner.nextInt(); } int[] s = new int[n]; int sum = 0; for (int i = 0; i < n; i++) { sum += a[i]; s[i] = sum; } int c = scanner.nextInt(); for (int k = 0; k < c; k++) { int p = scanner.nextInt(); int q = scanner.nextInt(); solve(a, s, p, q); } } private static void solve(int[] a, int[] s, int p, int q) { int sum = s[q]; if (p - 1 >= 0) { sum -= s[p - 1]; } System.out.println(sum); } }