Removal Game Gym - 101196F

http://codeforces.com/gym/101196/attachments

区间dp裸题 因为是个环 要将数组对接一下

因为是个环 所以最后两个元素的位置是不一定的 暴力枚举一下最后两个元素的位置 并顺手删去即可

 

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=0x3f3f3f3f;
const int maxm=1e3+10;
const int maxn=2e2+10;

int gcd[maxm][maxm],dp[maxn][maxn];
int ary[maxn];
int n;

void init()
{
    int i,j;
    for(i=1;i<=1000;i++){
        for(j=1;j<=1000;j++){
            gcd[i][j]=__gcd(i,j);
        }
    }
}

int main()
{
    int l,i,j,k,ans;
    init();
    while(scanf("%d",&n)!=EOF){
        if(n==0) break;
        for(i=1;i<=n;i++){
            scanf("%d",&ary[i]);
            ary[i+n]=ary[i];
        }
        memset(dp,0x3f,sizeof(dp));
        for(i=1;i+1<=2*n;i++){
            dp[i][i+1]=0;
        }
        for(l=3;l<=n;l++){
            for(i=1;i+l-1<=2*n;i++){
                j=i+l-1;
                for(k=i+1;k<=j-1;k++){
                    dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]+gcd[ary[i]][ary[j]]);
                }
            }
        }

        ans=N;
        for(i=1;i<=n;i++){
            for(j=i+1;j<=i+n;j++){
                ans=min(ans,dp[i][j]+dp[j][i+n]+gcd[ary[i]][ary[j]]);
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}