-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBall Elimination
51 lines (48 loc) · 915 Bytes
/
Ball Elimination
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll ar[501],dp[501][501];
ll solve(ll i,ll j){
if(i==j){
return 1;
}
if(i>j){
return 0;
}
if(dp[i][j]!=-1){
return dp[i][j];
}
ll temp=ar[i],ans=100000001;
for(ll k=i;k<=j;k++){
if(ar[k]==temp){
if(k==i){
ans=min(ans,1+solve(k+1,j));
}
else{
if(k==j){
ans=min(ans,solve(i+1,k-1));
}
else{
ans=min(ans,solve(i+1,k-1)+solve(k+1,j));
}
}
}
}
return dp[i][j]=ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,i,j;
cin>>n;
for(i=0;i<n;i++){
cin>>ar[i];
}
for(i=0;i<501;i++){
for(j=0;j<501;j++){
dp[i][j]=-1;
}
}
cout<<solve(0,n-1);
return 0;
}