# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92665 | toloraia | Money (IZhO17_money) | C++14 | 5 ms | 4344 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;
const int MAXN = 1e6;
int n;
int a[MAXN + 5];
int b[MAXN + 5];
int A[MAXN + 5][25], B[MAXN + 5][25];
int le[MAXN + 5];
int dp[MAXN + 5];
int datvla (int l, int r){
if (l > r)
return n + 1;
int x = 0, y = 1;
while (y * 2 < r - l + 1){
x++;
y *= 2;
}
return min (A[l][x], B[r][x]);
}
int main()
{
cin>>n;
for (int i = 1; i <= n; i++)
cin>>a[i];
for (int i = 1; i <= MAXN; i++)
b[i] = n + 1;
# | 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... |