# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866308 | epicci23 | Volontiranje (COCI21_volontiranje) | C++17 | 252 ms | 132368 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 int long long
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define sz(x) ((int)(x).size())
constexpr int N = 1e6 + 5;
int fw[N];
void upd(int c,int x){
for(;c<N;c+=c&-c) fw[c]=max(fw[c],x);
}
int query(int c,int res=0LL){
for(;c;c-=c&-c) res=max(res,fw[c]);
return res;
}
void solve(){
int n;
cin >> n;
int ar[n+5];
int dp[n+5];
for(int i=1;i<=n;i++) cin >> ar[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |