bzoj千题计划239：bzoj4069: [Apio2015]巴厘岛的雕塑

#include<cstdio>
#include<cstring>
#include<iostream>

#define N 2001

using namespace std;

typedef long long LL;

int n,a,b;
LL sum[N];

LL zero,ans;

bool dp1[N][N];

int dp2[N];

template<typename T>
void read(T &x)
{
    x=0; char c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) { x=x*10+c-‘0‘; c=getchar(); }
}

bool judge(int l,int r,int t)
{
    LL s=sum[r]-sum[l-1];
    return !(zero&s) && !(s&(1LL<<t));
} 

void solve1()
{
    for(int t=40;t>=0;--t)
    {    
        memset(dp1,false,sizeof(dp1));
        dp1[0][0]=true;
        for(int i=1;i<=n;++i)
            for(int j=1;j<=b;++j)
                for(int k=0;k<i;++k)
                    if(dp1[k][j-1] && judge(k+1,i,t)) dp1[i][j]=true;
        int j;
         for(j=a;j<=b;++j)
             if(dp1[n][j]) 
             {
                 zero+=1LL<<t;
                break;
            }
        if(j==b+1) ans+=1LL<<t;
    } 
}

void solve2()
{
    for(int t=40;t>=0;--t)
    {
        memset(dp2,63,sizeof(dp2));
        dp2[0]=0;
        for(int i=1;i<=n;++i)
            for(int j=0;j<i;++j)
                if(dp2[j]!=-1 && judge(j+1,i,t)) dp2[i]=min(dp2[i],dp2[j]+1);
        if(dp2[n]<=b) zero+=1LL<<t;
        else ans+=1LL<<t;
    } 
}

int main()
{
     //freopen("sculpture.in","r",stdin);
    //freopen("sculpture.out","w",stdout); 
    read(n); read(a); read(b);
     for(int i=1;i<=n;++i) read(sum[i]),sum[i]+=sum[i-1];
    if(a!=1) solve1();
     else solve2();
     cout<<ans;
}