Submission #1179927

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179927		MarwenElarbi	Fire (JOI20_ho_t5)	C++20	1 / 100	243 ms	327680 KiB

ho_t5

#include <bits/stdc++.h>
using namespace std;
const int nax=2e5+5;
vector<pair<int,int>> adj[nax]; 
int main(){
  int n,q;
  cin>>n>>q;
  vector<int> tab(n);
  for (int i = 0; i < n; ++i)
  {
    cin>>tab[i];
  }
  vector<int> cur[n+1];
  cur[0]=tab;
  for (int i = 1; i <= n; ++i)
  {
    cur[i].resize(n);
    cur[i][0]=cur[i-1][0];
    for (int j = n-1; j > 0; --j)
    {
      cur[i][j]=max(cur[i-1][j],cur[i-1][j-1]);
    }
  }
  while(q--){
    int x,l,r;
    cin>>x>>l>>r;
    l--;r--;
    long long sum=0;
    for (int i = l; i <= r; ++i)
    {
      sum+=cur[x][i];
    }
    cout <<sum<<endl;
  }
}

• Subtask 1: 1 / 1
• Subtask 2: 0 / 6
• Subtask 3: 0 / 7
• Subtask 4: 0 / 6
• Subtask 5: 0 / 80