Codeforces Round #336 (Div. 1) B. Zuma

B. Zuma

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as quickly as possible.

In one second, Genos is able to choose exactly one continuous substring of colored gemstones that is a palindrome and remove it from the line. After the substring is removed, the remaining gemstones shift to form a solid line again. What is the minimum number of seconds needed to destroy the entire line?

Let us remind, that the string (or substring) is called palindrome, if it reads same backwards or forward. In our case this means the color of the first gemstone is equal to the color of the last one, the color of the second gemstone is equal to the color of the next to last and so on.

Input

The first line of input contains a single integer n (1 ≤ n ≤ 500) — the number of gemstones.

The second line contains n space-separated integers, the i-th of which is ci (1 ≤ ci ≤ n) — the color of the i-th gemstone in a line.

Output

Print a single integer — the minimum number of seconds needed to destroy the entire line.

Sample test(s)

 input

 3

 1 2 1

 output

 1

 input

 3

 1 2 3

 output

 3

 input

 7

 1 4 4 2 3 2 1

 output

 2

Note

In the first sample, Genos can destroy the entire line in one second.

In the second sample, Genos can only destroy one gemstone at a time, so destroying three gemstones takes three seconds.

In the third sample, to achieve the optimal time of two seconds, destroy palindrome 4 4 first and then destroy palindrome 1 2 3 2 1.

题目链接：http://codeforces.com/contest/607/problem/B

题意：给你一个长度为n的整数数组，1<=a[i]<=n，每次只能删去一个回文子串，问最少需要删多少次。（如果还是不理解请参考样例）

分析：很经典的区间dp，我们设dp[i][j]表示删掉a[i]~a[j]这个整体所需要的次数是多少。j-i这个区间宽度是逐渐扩大的，每次计算当前宽度i~j时，一种情况为我们可以利用到之前计算过的dp[i][k]和dp[k+1][j]两个已经解决了的子问题，另一种情况是i~j这个区间最后一次删除是左端为i右端为j即a[i]==a[j]时有dp[i][j]=dp[i+1][j-1]，因为a[i]==a[j]是可以和i+1~j-1中最后一次删回文的时候一起删掉的。

代码：

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<math.h>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=510;
const int MAX=151;
const int MOD=1000007;
const int MOD1=100000007;
const int MOD2=100000009;
const int INF=1000000000;
const double EPS=0.00000001;
typedef long long ll;
typedef unsigned long long ull;
int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int a[N],dp[N][N];
int main()
{
    int i,j,k,n;
    scanf("%d", &n);
    for (i=1;i<=n;i++) scanf("%d", &a[i]);
    for (i=1;i<=n;i++) dp[i][i]=1;
    for (i=1;i<n;i++)
    if (a[i]==a[i+1]) dp[i][i+1]=1;
    else dp[i][i+1]=2;
    for (i=2;i<n;i++)
        for (j=1;j<=n-i;j++) {
            dp[j][j+i]=N+10;
            for (k=j;k<j+i;k++) dp[j][j+i]=min(dp[j][j+i],dp[j][k]+dp[k+1][j+i]);
            if (a[j]==a[j+i]) dp[j][j+i]=min(dp[j][j+i],dp[j+1][j+i-1]);
        }
    printf("%d\n", dp[1][n]);
    return 0;
}