# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152319 | Kalam | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++11 | 1458 ms | 104128 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.
// KALAM
# include<bits/stdc++.h>
using namespace std;
const int N = 1000000 + 77 , inf = 1000000000 + 77;
int n , q , a[N] , L[N] , Fen[N];
int Ql[N] , Qr[N] , Qk[N];
int A[N];
vector < int > Q[N];
inline void Update(int x , int y) {
x = N - x - 10;
for(;x < N;x += x & - x)
if(y > Fen[x])
Fen[x] = y;
}
inline int Get(int x) {
x = N - x - 10;
int res = 0;
for(;x;x ^= x & - x)
if(res < Fen[x])
res = Fen[x];
return res;
}
int main() {
a[0] = inf;
scanf("%d %d" , & n , & q);
for(int i = 1;i <= n;++ i) {
scanf("%d" , a + i);
L[i] = i - 1;
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |