URAL 1152. False Mirrors(DP)

题目链接

理解了题意之后，就不难了。。状态压缩+暴力.

 #include <cstring>
 #include <cstdio>
 #include <string>
 #include <iostream>
 #include <algorithm>
 #include <vector>
 #include <queue>
 #include <cmath>
 using namespace std;
 int dp[<<];
 int sum[<<];
 int p[];
 int minz;
 int main()
 {
     int i,n,j,t1,t2,x;
     scanf("%d",&n);
     for(i = ;i < n;i ++)
     {
         scanf("%d",&p[i]);
     }
     for(i = ;i < <<n;i ++)
     {
         dp[i] = ;
         for(j = ;j < n;j ++)
         {
             if(i&(<<j))
             sum[i] += p[j];
         }
     }
     dp[(<<n)-] = ;
     for(i = (<<n)-;i >= ;i --)
     {
         for(j = ;j < n;j ++)
         {
             if(i&(<<j))
             {
                 x = i - (<<j);
                 if(j- < )
                 t1 = n-;
                 else
                 t1 = j-;
                 if(j+ >= n)
                 t2 = ;
                 else
                 t2 = j+;
                 if(x&(<<t1))
                 x -= <<t1;
                 if(x&(<<t2))
                 x -= <<t2;
                 dp[x] = min(dp[x],dp[i]+sum[x]);
             }
         }
     }
     printf("%d\n",dp[]);
     return ;
 }