#include <bits/stdc++.h>
using namespace std;
const int N=320;
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;
for(int k=1; k<j; k++){
if(a[k] >= a[j] && a[k] <= a[i] && i!=j){
if(a[i] != a[j] && a[k] != a[j]){
flag = false;
break;
}
}
}
if(!flag)continue;
dp[i] = min(dp[i], dp[j-1] + 1);
//cout<<j<<" "<<i<<endl;
}
}
cout<<dp[n];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |