제출 #886286

#제출 시각아이디문제언어결과실행 시간메모리
886286Hovhannes1234Money (IZhO17_money)C++17
45 / 100
8 ms1060 KiB
#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=2; 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]){
					flag = false;
					break;
				}
			}
			if(!flag)continue;
			dp[i] = min(dp[i], dp[j-1] + 1);
			//cout<<j<<" "<<i<<endl;
		}
	}
	cout<<dp[n];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...