# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096223 | Muhammet | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 3097 ms | 58704 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 sz(s) (int)s.size()
#define ff first
#define ss second
#define ll long long
ll n, m;
int main(){
ios::sync_with_stdio (false); cin.tie(nullptr);
cin >> n >> m;
ll nq = sqrt(n), cnt = 0;
vector <ll> a(n+1), id(n+1), an(nq+10), mmx(nq+10);
vector <pair<ll,ll>> rn(n+1);
for(int i = 1; i <= n; i++){
cin >> a[i];
}
vector <ll> v[nq+10];
for(int i = 1; i <= n; i++){
cnt++;
ll mx = 0;
for(int j = i; j <= min(i+nq-1,n); j++){
if(mx > a[j]) an[cnt] = max(an[cnt],mx+a[j]);
mx = max(mx,a[j]);
id[j] = cnt;
v[cnt].push_back(a[j]);
}
# | 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... |