[BNDSOJ] 小P的数列代码

感谢gjznb大佬的帮助Orz

 #include<bits/stdc++.h>
 using namespace std;
 const int N=;
 vector<int> dp[N][N];
 bool book[];
 int a[N];
 int n;
 int main()
 {
     cin>>n;
     for(int i=;i<=n;i++)
     {
         cin>>a[i];
         dp[i][i].push_back(a[i]);
     }
     for(int l=;l<=n;l++)
     {
         for(int i=;i<=n-l;i++)
         {
             int j=i+l;
             memset(book,,sizeof(book));
             for(int k=i;k<j;k++)
             {
                 for(int ii=;ii<dp[i][j].size();ii++)
                 {
                     book[dp[i][j][ii]]++;
                 }
                 for(int ii=;ii<dp[i][k].size();ii++)
                 {
                     for(int jj=;jj<dp[k+][j].size();jj++)
                     {
                         int to=(dp[i][k][ii]+dp[k+][j][jj])/;
                         if(book[to]==)
                         {
                             dp[i][j].push_back(to);
                             book[to]=;
                         }
                     }
                 }
             }
         }
     }
     for(int i=;i<;i++)
     {
         if(book[i]) cout<<i<<" ";
     }
     return ;
 }