Submission #1179937

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179937		MarwenElarbi	Fire (JOI20_ho_t5)	C++20	8 / 100	324 ms	6192 KiB

ho_t5

#include <bits/stdc++.h>
using namespace std;
const int nax=2e5+5;
vector<int> tab(nax);
vector<int> segtree(nax*4);
void build(int pos,int l,int r){
  if(l==r){
    segtree[pos]=tab[l];
    return;
  }
  int mid=(r+l)/2;
  build(pos*2+1,l,mid);
  build(pos*2+2,mid+1,r);
  segtree[pos]=max(segtree[pos*2+1],segtree[pos*2+2]);
}
long long query(int pos,int l,int r,int left,int right){
  if(l>r||l>right||r<left) return 0;
  if(l>=left&&r<=right) return segtree[pos];
  int mid=(r+l)/2;
  return max(query(pos*2+1,l,mid,left,right),query(pos*2+2,mid+1,r,left,right));
}
int main(){
  int n,q;
  cin>>n>>q;
  for (int i = 0; i < n; ++i)
  {
    cin>>tab[i];
  }
  if(n<=200){
    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;
    }
  }else{
    build(0,0,n-1);
    while(q--){
      int x,l,r;
      cin>>x>>l>>r;
      l--;r--;
      cout << query(0,0,n-1,max(0,l-x),l)<<endl;  
    }
  }  
}

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