[BNDSOJ] 小P的数列代码

感谢gjznb大佬的帮助Orz

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