oj.uz

Submission #886280

# Submission time Handle Problem Language Result Execution time Memory
886280 2023-12-11T17:04:13 Z Hovhannes1234 Money (IZhO17_money) C++17
0 / 100
 0 ms 348 KB 
#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];
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -