Modern Art 3【区间DP】

>Link

luogu P7414

---

>Description

---

>解题思路

吐了啊写过一样的题目，但是赛时没写出来，果然我还是菜，得多看看自己的博客QAQ

---

>代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 310
using namespace std;

int n, a[N], f[N][N];

int main()
{
	memset (f, 0x7f, sizeof (f));
	scanf ("%d", &n);
	for (int i = 1; i <= n; i++)
	{
		scanf ("%d", &a[i]);
		f[i][i] = 1;
	}
	for (int t = 2; t <= n; t++)
	  for (int i = 1; i <= n - t + 1; i++)
	  {
	  	int j = i + t - 1;
	  	if (a[i] == a[j]) f[i][j] = min (f[i + 1][j], f[i][j - 1]);
	  	for (int k = i; k < j; k++)
	  	  f[i][j] = min (f[i][j], f[i][k] + f[k + 1][j]);
	  }
	printf ("%d", f[1][n]);
	return 0;
}