504 数组划分 二分+动态规划+位运算 [代码源][namomo spring camp]每日一题div1

//acmer mxc
#include<bits/stdc++.h>
#define mst(s,x) memset(s,x,sizeof(s));
#define sr(x) scanf("%lld",&x); 
#define sr2(a,b) scanf("%d%d",&a,&b); 
#define sr3(a,b,c) scanf("%d%d%d",&a,&b,&c); 
#define f(i,a,n) for(int i=a;i<=n;i++)
#define sc(x) cout<<#x<<" : "<<x<<endl;
#define hh cout<<endl;
#define pii pair<int,int>
#define pb(x) push_back(x)
#define mk(a,b) make_pair(a,b)
#define ls(x) x<<1
#define rs(x) x<<1|1
#define fi first
#define se second
#define inf 0x3f3f3f3f
#define ll __int128

using namespace std;
inline ll read()
{
	ll x=0,w=1; char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
	while(c<='9'&&c>='0') x=(x<<1)+(x<<3)+c-'0',c=getchar();
	return w==1?x:-x;
}
inline void write(ll x)
{
	if(x>=10) write(x/10);
	putchar(x%10+'0');
}
//------------------------------------------------
//#define int __int128
#define int long long
#define LL long long 
const int N=1e5+5;
const int M=1e3+3;
int dp[M][M];
int a[N];
int sum[N];
int n,k;
bool check(int mid)
{	
	mst(dp,0);
	dp[0][0]=1;
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<i;j++)
		{
			if(((sum[i]-sum[j])&mid)==mid)
			{
				for(int z=1;z<=k;z++)
				{
					dp[z][i]|=dp[z-1][j];
				}
			}
		}
	}
	return dp[k][n];
}
inline void solve()
{
	scanf("%lld%lld",&n,&k);
	for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
	for(int i=1;i<=n;i++)sum[i]=sum[i-1]+a[i];
	LL ans=0;
	for(int i=57;i>=0;i--)
	{
		if(check(ans|(1LL<<i))) ans=ans|(1LL<<i);
	}
	printf("%lld",ans);
}

//------------------------------------------------
signed main()
{
	clock_t c1=clock();
#ifdef LOCAL
    freopen("in.in","r",stdin);
    freopen("out.out","w",stdout);
#endif
//==================================
    int T=1;
	// cin>>T;
	for(int i=1;i<=T;i++)
	{
		solve();
	}
//==================================
end:
    cerr<< endl << "Time used:" << clock() - c1 << endl;
	return 0;
}