sdut1283Five in a Row, Again

一简单的状压题 比赛时跑偏了 ，脑子最近乱的跟浆糊似得呢。。

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<vector>
 using namespace std;
 int dp[][],o[][];
 int w[][],ee[][],s[];
 int main()
 {
     int i,j,n,t,e;
     cin>>t;
     while(t--)
     {
         memset(dp,,sizeof(dp));
         memset(o,,sizeof(o));
         cin>>n;
         for(i = ; i <= n ;i++)
             for(j = ; j <= n ; j++)
             cin>>w[i][j];
         for(i = ; i <= n ; i++)
             for(j = ; j <= n ;j++)
             cin>>ee[i][j];
         for(i = ; i <= n ;i++)
             cin>>s[i];
         if(n==)
         {
             cout<<"0\n";
             continue;
         }
         for(i =  ; i < n ;i++)
         {
             if(s[]>s[i+])
             {
                 dp[][<<(i-)] = ee[][i+];
             }
             else
             dp[][<<(i-)] = ;
             o[][<<(i-)] = ;
         }
         for(i = ; i < n ;i++)
         {
             for(j =  ; j < (<<(n-)) ; j++)
             {
                 int ts=s[];
                 if(!o[i-][j]) continue;
                 for(e =  ; e < n ; e++)
                 {
                     if(j&(<<(e-)))
                     {
                         ts+=w[][e+];
                     }
                 }
                 for(e = ; e < n ; e++)
                 {
                     if((j&(<<(e-)))==)
                     {
                         if(ts>s[e+])
                         dp[i][j+(<<(e-))] = max(dp[i][j+(<<(e-))],dp[i-][j]+ee[][e+]);
                         else
                         dp[i][j+(<<(e-))] = max(dp[i][j+(<<(e-))],dp[i-][j]);
                         o[i][j+(<<(e-))] = ;
                     }
                 }
             }
         }
         cout<<dp[n-][(<<(n-))-]<<endl;
     }
     return ;
 }
 
 /**************************************
     Problem id    : SDUT OJ 1283
     User name    : shang
     Result        : Accepted
     Take Memory    : 1060K
     Take Time    : 0MS
     Submit Time    : 2014-02-14 23:02:39
 **************************************/