# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91102 | emil_physmath | Money (IZhO17_money) | C++14 | 1543 ms | 5900 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 <stdio.h>
#include <algorithm>
#include <set>
using namespace std;
int a[1000005], dp[1000005];
int main()
{
int n;
cin>>n;
for (int k=0; k<n; k++)
scanf("%d", a+k);
set<int>curSorted;
for (int i=0; i<n; i++)
{
dp[i]=i+1;
for (int j=i; j>=0; j--)
{
if (j<i && a[j]>a[j+1]) break;
curSorted.clear();
curSorted.insert(0);
curSorted.insert(10000000);
for (int k=0; k<j; k++)
curSorted.insert(a[k]);
if (a[i]<=*curSorted.upper_bound(a[j]))
dp[i]=min(dp[i], dp[j-1]+1);
}
}
cout<<dp[n-1]<<'\n';
//int i=0, ans=0;
//set<int> curSorted;
//curSorted.insert(0);
//curSorted.insert(10000000);
//while (i<n)
//{
// ans++;
// int j=i;
// while (j+1<n && a[j+1]>a[j])
// j++;
// auto rBound=curSorted.upper_bound(a[i]);
// j=upper_bound(a+i, a+j+1, *rBound)-a;
// for (int k=i; k<j; k++)
// curSorted.insert(a[k]);
// i=j;
//}
//cout<<ans<<'\n';
char I;
cin >> I;
return 0;
}
/*
9
2 5 4 3 5 6 4 6 7
5
1 2 4 3 5
*/
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |