fork download 
  1.  
  2.     #include <bits/stdc++.h>
  3.  
  4.     using namespace std;
  5.  
  6.     using ll = long long;
  7.     const int MOD = 1000000007; 
  8.     const int MOD2 =  998244353; 
  9.     const ll INF = 1e18;
  10.     const int MX = 1000001; //check the limits, dummy
  11.  
  12.  
  13.     ll modExp(ll base, ll power) {
  14.         if (power == 0) {
  15.             return 1;
  16.         } else {
  17.             ll cur = modExp(base, power / 2); cur = cur * cur; cur = cur % MOD;
  18.             if (power % 2 == 1) cur = cur * base;
  19.             cur = cur % MOD;
  20.             return cur;
  21.         }
  22.     }
  23.  
  24.     ll inv(ll base) {
  25.         return modExp(base, MOD-2);
  26.     }
  27.  
  28.  
  29.     ll mul(ll A, ll B) {
  30.         return (A*B)%MOD;
  31.     }
  32.  
  33.     ll add(ll A, ll B) {
  34.         return (A+B)%MOD;
  35.     }
  36.  
  37.     ll dvd(ll A, ll B) {
  38.         return mul(A, inv(B));
  39.     }
  40.  
  41.     ll sub(ll A, ll B) {
  42.         return (A-B+MOD)%MOD;
  43.     }
  44.  
  45.     ll* facs = new ll[MX];
  46.     ll* facInvs = new ll[MX];
  47.  
  48.     ll choose(ll a, ll b) {
  49.         if (b > a) return 0;
  50.         if (a < 0) return 0;
  51.         if (b < 0) return 0;
  52.         ll cur = facs[a];
  53.         cur = mul(cur, facInvs[b]);
  54.         cur = mul(cur, facInvs[a-b]);
  55.         return cur;
  56.     }
  57.  
  58.     void initFacs() {
  59.         facs[0] = 1; 
  60.         facInvs[0] = 1;
  61.         for (int i = 1 ; i < MX ; i ++ ) {
  62.             facs[i] = (facs[i-1] * i) % MOD;
  63.             facInvs[i] = inv(facs[i]);
  64.         }
  65.     }
  66.  
  67.     int solve(int l , int r  ,vector<int> &arr) {
  68.         if (l == 0) {
  69.             return arr[r];
  70.         }
  71.  
  72.         return arr[r] - arr[l - 1]; 
  73.     }
  74.     int main()  {
  75.         ios_base::sync_with_stdio(0); cin.tie(0);  
  76.  
  77.         int n ; cin >> n;
  78.         vector<int> arr(n); 
  79.         for (int i = 0 ;i < n; i ++) {
  80.             cin >> arr[i];
  81.         }
  82.         vector<int> sorted = arr;
  83.         sort(sorted.begin(), sorted.end()); 
  84.         vector<int> cum(n, 0);
  85.         vector<int> cumsorted (n, 0);
  86.         cum[0] = arr[0]; 
  87.         cumsorted[0] = sorted[0];
  88.         for (int i = i  ; i < n; i ++) {
  89.             cum[i] = cum[i - 1] + arr[i];
  90.             cumsorted[i] = cumsorted[i - 1] + sorted[i];
  91.         } 
  92.  
  93.         int q ; cin >> q;
  94.         while (q --) {
  95.             int a,b,c ; cin >> a >> b >> c ;
  96.             c --  ;
  97.             b -- ;
  98.             if (a == 1) {
  99.                 cout << solve(b,c,cum) << endl;
  100.             } else {
  101.                 cout << solve(b,c,cumsorted) << endl; 
  102.             }         
  103.         }
  104.         // dow
  105.         return 0;
  106.     }
  107.  
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin 
6
6 4 2 7 2 7
3
2 3 6
1 3 4
1 1 6
stdout 
24
9
28
https://ideone.com/Xd148D
language:
C++ (gcc 8.3)
created:
7 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!