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 N=305;
vector <int> a(N), dp(N);
int main() {
int n;
cin>>n;
for(int i=1; i<=n; i++)
cin>>a[i];
dp[0] = 0;
dp[1] = 1;
for(int i=2; i<=n; i++)dp[i]=1e7;
for(int i=1; i<=n; i++){
for(int j=1; j<=i; j++){
bool flag = true;
for(int k=j; k<i; k++){
if(a[k] > a[k+1]){
flag = false;
break;
}
}
if(!flag)continue;
//int lower_i = lower_bound(a.begin(), a.end(), i) - a.begin();
dp[i] = min(dp[i], dp[j-1] + 1);
//cout<<j<<" "<<i<<endl;
}
}
cout<<dp[n];
}
# | 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... |