Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 2 KBi |
#2 |
Correcto
|
0.006 s | 2 KBi |
#3 |
Correcto
|
0.007 s | 1 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.008 s | 2 KBi |
#7 |
Correcto
|
0.006 s | 1 KBi |
#8 |
Correcto
|
0.04 s | 2 KBi |
#9 |
Correcto
|
0.178 s | 2 KBi |
#10 |
Correcto
|
0.209 s | 2 KBi |
#11 |
Correcto
|
0.264 s | 2 KBi |
#12 |
Correcto
|
0.149 s | 2 KBi |
#13 |
Correcto
|
0.193 s | 2 KBi |
#14 |
Correcto
|
0.21 s | 2 KBi |
// #include <bits/stdc++.h> using namespace std; #define INF 1000000000 #define MOD 1000000007 #define PI 3.14159265 #define EPS 1e-9 #define Pi acos(-1.0) typedef pair<int, int> ii; typedef long long ll; typedef vector<ll> vll; typedef pair<ll,ll> pll; #define forr(i,a,b) for(int i=(a); i<(b); i++) #define clean(arr,val) memset(arr,val,sizeof(arr)) #define forn(i,n) forr(i,0,n) #define PB push_back typedef vector<int> vi; typedef vector<ii> vii; typedef vector<pll> vpll; /*CODE START HERE*/ int n, m, sum, p, q; int arr[50005]; int dp[50005]; int main(){ ios::sync_with_stdio(0); clean(dp,0); cin >> n; forn(i,n){ cin >> arr[i]; sum = 0; dp[i+1] = dp[i]+arr[i]; } cin >> m; while(m--){ cin >> p >> q; cout << dp[q+1]-dp[p] << "\n"; } return 0; }