【DP】 Light OJ 1422 Halloween Costumes

来源：互联网发布：grub2 引导linux 编辑：程序博客网时间：2024/05/16 15:52

地址：点击打开链接

#include <cstdio>#include <cstring>#include <cstdlib>#include <string>#include <iostream>#include <algorithm>#include <sstream>#include <cmath>using namespace std;#include <queue>#include <stack>#include <vector>#include <deque>#include <map>#define cler(arr, val)    memset(arr, val, sizeof(arr))typedef long long  LL;const int MAXN = 10000+6;const int MAXM = 140000;const int INF = 0x3f3f3f3f;const int mod = 1000000007;int a[122],dp[122][122];int main(){#ifndef ONLINE_JUDGE    freopen("in.txt", "r", stdin);//    freopen("out.txt", "w", stdout);#endif    int t,n,cas=1;    cin>>t;    while(t--)    {        cin>>n;        for(int i=1;i<=n;i++)            scanf("%d",&a[i]);        cler(dp,0);        for(int i=1;i<=n;i++)            dp[i][i]=1;        for(int i=n-1;i>=1;i--)        {            for(int j=i+1;j<=n;j++)            {                dp[i][j]=dp[i+1][j]+1;                for(int k=i+1;k<=j;k++)                {                    if(a[i]==a[k])                        dp[i][j]=min(dp[i][j],dp[i+1][k-1]+dp[k][j]);                }            }        }        printf("Case %d: %d\n",cas++,dp[1][n]);    }    return 0;}

0 0