2012 ACM/ICPC Asia Regional Changchun Online LianLianKan

http://acm.hdu.edu.cn/showproblem.php?pid=4272

呜呜，有谁用dp过的，请说一下思路。YYYYYYYYYYYMMMMMMMMM路过的大神。

#include<stdio.h>
#include<string.h>
int as[1005],vis[1005];
int main()
{
    int i,j,k,n;
    while(scanf("%d",&n)==1){
        memset(vis,0,sizeof(vis));
        for(i = 1; i <= n; ++ i)
            scanf("%d",as+i);
        for(i = 1; i <= n; ++ i)if(!vis[i]){
            k = 0;
            for(j = i + 1; j <= n; ++ j)
                if((as[i]==as[j])&&(!vis[j]))break;
                else if(!vis[j]) k++;
            if(k>5||j>n)break;
            else vis[j] = 1;
        }
        if(i>n)puts("1");
        else puts("0");
    }
    return 0;
}