# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98165 | 314rate | Cambridge (info1cup18_cambridge) | C++14 | 2090 ms | 15468 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;
struct RMQ_MAX
{
vector<vector<int>>ret;
vector<int>mylog;
void build(int n,int a[])
{
ret.resize(n+1);
mylog.resize(n+1);
for(int i=2;i<=n;i++)
{
mylog[i]=1+mylog[i/2];
}
for(int i=1;i<=n;i++)
{
ret[i].resize(mylog[n]+1,-(1<<30));
ret[i][0]=a[i];
}
for(int k=1;(1<<k)<=n;k++)
{
for(int i=1;i+(1<<k)-1<=n;i++)
{
ret[i][k]=max(ret[i][k-1],ret[i+(1<<(k-1))][k-1]);
}
}
}
int gt(int l,int r)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |