# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
494339 | boris_mihov | Floppy (RMI20_floppy) | C++14 | 101 ms | 22940 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 <iostream>
#include <stdlib.h>
#include <string.h>
#include "floppy.h"
using namespace std;
const int maxn = 1e5+10, maxlog = 20;
int sparse[maxlog][2*maxn], n;
int get_log[maxn];
int parent[maxn];
vector < int > g[maxn], a;
string s;
int cmp(int x, int y) {
if (a[x] > a[y]) return x;
return y;
}
int find_max(int l, int r) {
int log = get_log[r-l+1];
return cmp(sparse[log][l], sparse[log][r - (1 << log) + 1]);
}
int cnt;
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... |