# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546740 | krit3379 | Secret (JOI14_secret) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define N 1005
int n,dp[N][N];
int sol(int l,int r,int *a){
if(dp[l][r]!=-1)return dp[l][r];
if(l==r)return dp[l][r]=a[l];
int mid=(l+r)/2;
sol(l,mid,a);
sol(mid+1,r,a);
for(int i=l;i<=mid;i++)dp[i][r]=Secret(dp[i][mid],dp[mid+1][r]);
}
void Init(int nn, int *a){
n=nn;
for(int i=0;i<n;i++)for(int j=0;j<n;j++)dp[i][j]=-1;
sol(0,(n-1)/2,a);
if(n>1)sol((n-1)/2+1,n-1,a);
}
int Query(int ll, int rr){
int l=0,r=n-1;
if(ll==rr)return dp[ll][rr];
while(l<=r){
int mid=(l+r)/2;
if(ll<=mid&&mid<rr)return Secret(dp[ll][mid],dp[mid+1][rr]);
if(rr<=mid)r=mid;
else l=mid+1;
}
}