# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341562 | nandonathaniel | Money (IZhO17_money) | C++14 | 1473 ms | 67236 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+5;
int a[MAXN],dp[MAXN],mini,maxi,kel[MAXN],terakhir[MAXN];
set<int> S;
bool valid(){
if(mini==maxi)return true;
auto it=S.upper_bound(mini);
auto it2=S.lower_bound(maxi);
return it==it2;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin >> n;
for(int i=1;i<=n;i++)cin >> a[i];
int last=1,idx=0;
for(int i=1;i<=n;i++){
if(i==n || a[i]>a[i+1]){
idx++;
for(int j=last;j<=i;j++)kel[j]=idx;
last=i+1;
terakhir[idx]=i;
}
dp[i]=1e9;
}
S.insert(0);
# | 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... |