「杂题乱刷」洛谷 P2572
1.「杂题乱刷」CF624B2.「杂题乱刷」CF1221B3.「杂题乱刷」CF1585B4.「杂题乱刷」CF468A5.「杂题乱刷」洛谷P95156.「杂题乱刷」CF283A7.「杂题乱刷」CF1534C8.「杂题乱刷」洛谷P92539.「杂题乱刷」洛谷P106410.「杂题乱刷」洛谷P228511.「杂题乱刷」洛谷P154412.「杂题乱刷」洛谷P121613.「杂题乱刷」CF1904B14.「杂题乱刷」CF1272D15.「杂题乱刷」CF1620E16.「杂题乱刷」CF1105C17.「杂题乱刷」CF961B18.「杂题乱刷」CF978G19.「杂题乱刷」洛谷P242620.「杂题乱刷」洛谷P953321.「杂题乱刷」CF1914E1 & CF1914E222.「杂题乱刷」AT_abc280_e23.「杂题乱刷」AT_abc280_d24.「杂题乱刷」AT_abc020_c25.「杂题乱刷」CF1916C26.「杂题乱刷」AT_arc041_b27.【待补题解】AT_arc146_a28.「杂题乱刷」AT_abc007_329.「杂题乱刷」AT_abc008_330.「杂题乱刷」AT_abc337_e31.「杂题乱刷」洛谷 P155832.「杂题乱刷」AT_abc308_f33.「杂题乱刷」AT_abc307_e34.「杂题乱刷」ZhengRui 54. 【17 普及 13】幻想嘉年华35.「杂题乱刷」CF1925C & CF1924A36.「杂题乱刷」AT_abc208_e37.「杂题乱刷」CF1927D38.「杂题乱刷」CF1886D39.「杂题乱刷」P868740.「杂题乱刷」洛谷 P1015541.「杂题乱刷」洛谷 P183142.「杂题乱刷」洛谷 P395243.「杂题乱刷」洛谷 P171244.「杂题乱刷」CF954C45.「杂题乱刷」洛谷 P886646.「杂题乱刷」CF1937C & CF1936A47.「杂题乱刷」CF1934D248.「杂题乱刷」洛谷 P480149.「杂题乱刷」CF1846E1 & CF1846E250.「杂题乱刷」ZhengRui 611 【19寒假普转提】树的权51.「杂题乱刷」ZhengRui 281 汪初雪与高流星52.「杂题乱刷」洛谷 P1708
53.「杂题乱刷」洛谷 P2572
54.ZRcsp内训day7题解55.「杂题乱刷」at_abc092_d & AT_arc093_b56.「杂题乱刷」CF74E57.「杂题乱刷」CF786C58.「杂题乱刷」洛谷 P239859.「杂题乱刷」AT_abc230_e60.「杂题乱刷」AT_abc314_e61.「杂题乱刷」AT_abc253_c62.「杂题乱刷」AT_abc279_e63.「杂题乱刷」AT_abc220_f64.「杂题乱刷」AT_abc096_d65.「杂题乱刷」Zheng Rui 327 【2018普转提day17专题】洗66.「杂题乱刷」洛谷 P10468 兔子与兔子67.「杂题乱刷」洛谷 P1046768.「杂题乱刷」AT_abc211_e69.「杂题乱刷」AT_abc354_f70.「杂题乱刷」CF1973D71.「杂题乱刷」CF1759F72.「杂题乱刷」CF1650D73.「杂题乱刷」CF1650E74.「杂题乱刷」P857275.「杂题乱刷」CF1977B76.「杂题乱刷」CF1977C77.「杂题乱刷」 AT_abc285_e78.「杂题乱刷」CF460C79.「杂题乱刷」P827980.「杂题乱刷」P881681.「杂题乱刷」AT_abc179_e82.「杂题乱刷」AT_abc126_e83.「杂题乱刷」CF1979C84.「杂题乱刷」AT_abc160_e85.「杂题乱刷」AT_abc357_f86.「杂题乱刷」P1051287.「杂题乱刷」AT_abc132_e88.「杂题乱刷」AT_abc154_e89.「杂题乱刷」CF1985F90.「杂题乱刷」AT_abc161_d91.「杂题乱刷」P139692.「杂题乱刷」AT_abc358_g93.「杂题乱刷」AT_abc359_d94.「杂题乱刷」 AT_abc123_d95.「杂题乱刷」P7840 & AT_abc359_f96.「杂题乱刷」CF1987C97.「杂题乱刷」CF1987D98.「杂题乱刷」AT_abc360_d99.「杂题乱刷」P10678先上 AC 代码:
点击查看代码
/*
Tips:
你数组开小了吗?
你MLE了吗?
你觉得是贪心,是不是该想想dp?
一个小时没调出来,是不是该考虑换题?
*/
#include<bits/stdc++.h>
using namespace std;
#define map unordered_map
#define forl(i,a,b) for(register long long i=a;i<=b;i++)
#define forr(i,a,b) for(register long long i=a;i>=b;i--)
#define forll(i,a,b,c) for(register long long i=a;i<=b;i+=c)
#define forrr(i,a,b,c) for(register long long i=a;i>=b;i-=c)
#define lc(x) x<<1
#define rc(x) x<<1|1
#define mid ((l+r)>>1)
#define cin(x) scanf("%lld",&x)
#define cout(x) printf("%lld",x)
#define lowbit(x) x&-x
#define pb push_back
#define pf push_front
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define endl '\n'
#define QwQ return 0;
#define ll long long
#define lcm(x,y) x/__gcd(x,y)*y
#define Sum(x,y) 1ll*(x+y)*(y-x+1)/2
ll t,sq;
struct node{
ll L,R,sum,fir,firpd,beh,behpd,tag,fugai,len,max1,max0,max1pd,max0pd;
}bl[100010];
ll a[100010],b[100010],n,m;
void upd(ll id)
{
if(bl[id].fugai!=-1)
{
forl(i,bl[id].L,bl[id].R)
a[i]=bl[id].fugai;
bl[id].fir=bl[id].len;
bl[id].beh=bl[id].len;
bl[id].firpd=bl[id].fugai;
bl[id].behpd=bl[id].fugai;
bl[id].sum=bl[id].fugai*bl[id].len;
bl[id].max1=bl[id].fugai*bl[id].len;
bl[id].max0=(bl[id].fugai^1)*bl[id].len;
bl[id].max1pd=1;
bl[id].max0pd=1;
bl[id].fugai=-1;
bl[id].tag=0;
return ;
}
if(bl[id].tag)
forl(i,bl[id].L,bl[id].R)
a[i]^=1;
bl[id].sum=0,bl[id].fir=0,bl[id].firpd=0,bl[id].beh=0,bl[id].behpd=0,bl[id].fugai=-1,bl[id].tag=0;
ll sum=0,Maxn=0;
forl(j,bl[id].L,bl[id].R)
{
if(a[j]==1)
sum++;
else
Maxn=max(Maxn,sum),sum=0;
}
bl[id].max1=max(Maxn,sum);
sum=0,Maxn=0;
forl(j,bl[id].L,bl[id].R)
{
if(a[j]==0)
sum++;
else
Maxn=max(Maxn,sum),sum=0;
}
bl[id].max0=max(Maxn,sum);bl[id].max0pd=1;bl[id].max1pd=1;
ll Sum=0;
forl(j,bl[id].L,bl[id].R)
Sum+=a[j];
forl(j,bl[id].L+1,bl[id].R)
{
if(a[bl[id].L]==a[j])
bl[id].fir++;
else
break;
}
bl[id].fir++;
forr(j,bl[id].R-1,bl[id].L)
{
if(a[bl[id].R]==a[j])
bl[id].beh++;
else
break;
}
bl[id].beh++;
bl[id].sum=Sum;
if(a[bl[id].L])
bl[id].firpd=1;
if(a[bl[id].R])
bl[id].behpd=1;
}
void upd1(ll l,ll r)
{
if(b[l]==b[r])
{
upd(b[l]);
forl(i,l,r)
a[i]=0;
upd(b[l]);
return ;
}
upd(b[l]);
forl(i,l,bl[b[l]].R)
a[i]=0;
upd(b[l]);
upd(b[r]);
forl(i,bl[b[r]].L,r)
a[i]=0;
upd(b[r]);
forl(i,b[l]+1,b[r]-1)
bl[i].fugai=0,bl[i].sum=0,bl[i].fir=bl[i].len,bl[i].beh=bl[i].len,
bl[i].firpd=0,bl[i].behpd=0,bl[i].tag=0,
bl[i].max1=bl[i].fugai*bl[i].len,
bl[i].max0=(bl[i].fugai^1)*bl[i].len,
bl[i].max1pd=1,
bl[i].max0pd=1;
}
void upd2(ll l,ll r)
{
if(b[l]==b[r])
{
upd(b[l]);
forl(i,l,r)
a[i]=1;
upd(b[l]);
return ;
}
upd(b[l]);
forl(i,l,bl[b[l]].R)
a[i]=1;
upd(b[l]);
upd(b[r]);
forl(i,bl[b[r]].L,r)
a[i]=1;
upd(b[r]);
forl(i,b[l]+1,b[r]-1)
bl[i].fugai=1,bl[i].sum=bl[i].len,bl[i].fir=bl[i].len,bl[i].beh=bl[i].len,
bl[i].firpd=1,bl[i].behpd=1,bl[i].tag=0,
bl[i].max1=bl[i].fugai*bl[i].len,
bl[i].max0=(bl[i].fugai^1)*bl[i].len,
bl[i].max1pd=1,
bl[i].max0pd=1;
}
void upd3(ll l,ll r)
{
if(b[l]==b[r])
{
upd(b[l]);
forl(i,l,r)
a[i]^=1;
upd(b[l]);
return ;
}
upd(b[l]);
forl(i,l,bl[b[l]].R)
a[i]^=1;
upd(b[l]);
upd(b[r]);
forl(i,bl[b[r]].L,r)
a[i]^=1;
upd(b[r]);
forl(i,b[l]+1,b[r]-1)
{
if(bl[i].fugai==-1)
bl[i].sum=bl[i].len-bl[i].sum,bl[i].firpd^=1,bl[i].behpd^=1,bl[i].tag^=1,swap(bl[i].max1,bl[i].max0);
else
{
bl[i].fugai^=1;
if(bl[i].fugai==1)
bl[i].sum=bl[i].len,bl[i].fir=bl[i].len,bl[i].beh=bl[i].len,bl[i].firpd=1,bl[i].behpd=1;
else
bl[i].sum=0,bl[i].fir=bl[i].len,bl[i].beh=bl[i].len,bl[i].firpd=0,bl[i].behpd=0;
bl[i].max1=bl[i].fugai*bl[i].len;
bl[i].max0=(bl[i].fugai^1)*bl[i].len;
bl[i].max1pd=1;
bl[i].max0pd=1;
}
}
}
ll query1(ll l,ll r)
{
if(b[l]==b[r])
{
ll Sum=0;
upd(b[l]);
forl(i,l,r)
Sum+=a[i];
return Sum;
}
ll Sum=0;
upd(b[l]);
forl(i,l,bl[b[l]].R)
Sum+=a[i];
upd(b[r]);
forl(i,bl[b[r]].L,r)
Sum+=a[i];
forl(i,b[l]+1,b[r]-1)
Sum+=bl[i].sum;
return Sum;
}
ll query2(ll l,ll r)
{
ll Sum=0,maxn=0;
if(b[l]==b[r])
{
upd(b[l]);
forl(i,l,r)
{
if(a[i])
Sum++;
else
maxn=max(maxn,Sum),Sum=0;
}
return max(maxn,Sum);
}
upd(b[l]);
upd(b[r]);
forl(i,l,bl[b[l]].R)
{
if(a[i])
Sum++;
else
maxn=max(maxn,Sum),Sum=0;
}
forl(i,b[l]+1,b[r]-1)
{
if(bl[i].fir*bl[i].firpd==bl[i].len)
{
Sum+=bl[i].len;
continue;
}
/* else if(bl[i].fir==bl[i].len)
{
maxn=max(maxn,Sum);
Sum=0;
continue;
}*/
else
{
Sum+=bl[i].fir*bl[i].firpd;
maxn=max(maxn,Sum);
Sum=bl[i].beh*bl[i].behpd;
}
// if(bl[i].firpd+bl[i].behpd==0)
maxn=max(maxn,bl[i].max1);
}
forl(i,bl[b[r]].L,r)
{
if(a[i]==1)
Sum++;
else
maxn=max(maxn,Sum),Sum=0;
}
return max(maxn,Sum);
}
void solve()
{
cin>>n>>m;
sq=pow(sqrt(n),0.66);
forl(i,1,n)
cin>>a[i];
forl(i,1,n)
{
bl[i].L=bl[i-1].R+1;
bl[i].R=min(n,i*sq);
ll Sum=0;
forl(j,bl[i].L,bl[i].R)
Sum+=a[j],b[j]=i;
forl(j,bl[i].L+1,bl[i].R)
{
if(a[bl[i].L]==a[j])
bl[i].fir++;
else
break;
}
bl[i].fir++;
forr(j,bl[i].R-1,bl[i].L)
{
if(a[bl[i].R]==a[j])
bl[i].beh++;
else
break;
}
ll sum=0,Maxn=0;
forl(j,bl[i].L,bl[i].R)
{
if(a[j]==1)
sum++;
else
Maxn=max(Maxn,sum),sum=0;
}
bl[i].max1=max(Maxn,sum);
sum=0,Maxn=0;
forl(j,bl[i].L,bl[i].R)
{
if(a[j]==0)
sum++;
else
Maxn=max(Maxn,sum),sum=0;
}
bl[i].max0=max(Maxn,sum);bl[i].max0pd=1;bl[i].max1pd=1;
bl[i].beh++;
bl[i].sum=Sum;
bl[i].fugai=-1;
bl[i].len=bl[i].R-bl[i].L+1;
if(a[bl[i].L])
bl[i].firpd=1;
if(a[bl[i].R])
bl[i].behpd=1;
if(bl[i].R==n)
break;
}
while(m--)
{
ll opt,l,r;
cin>>opt>>l>>r;
l++,r++;
if(opt==0)
upd1(l,r);
else if(opt==1)
upd2(l,r);
else if(opt==2)
upd3(l,r);
else if(opt==3)
cout<<query1(l,r)<<endl;
else
cout<<query2(l,r)<<endl;
/* forl(i,1,n)
upd(i);
forl(i,1,n)
{
cout<<a[i]<<' ';
if(i==706)
cout<<endl;
}
cout<<endl;*/
}
}
/*
1000 2
1 1 0 1 0 1 1 0 1 1 0 0 0 0 1 0 1 0 0 0 1 0 1 1 1 0 0 1 0 0 1 1 0 0 0 1 1 0 1 1 1 1 0 1 0 1 1 1 0 0 0 1 1 0 0 1 0 1 0 1 1 1 0 0 1 1 0 1 0 0 0 0 1 1 0 1 1 0 0 1 1 1 1 1 0 0 0 0 1 1 0 0 0 1 0 1 1 0 1 0 1 0 1 0 0 1 1 1 1 0 0 0 1 0 0 0 1 1 1 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 0 0 0 1 1 0 1 0 1 1 0 0 0 0 0 0 0 1 0 1 1 1 0 1 1 0 0 0 1 1 0 0 1 0 0 1 1 1 0 1 0 0 1 1 1 0 0 0 1 1 0 0 1 1 0 0 1 1 1 0 1 0 1 1 1 1 1 0 1 1 1 1 0 1 0 1 0 1 1 1 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 0 1 1 0 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 0 0 1 0 1 1 0 0 1 1 1 1 1 1 0 1 0 0 1 0 1 0 0 1 1 1 1 1 1 0 0 1 0 1 0 1 0 1 1 0 1 0 1 0 0 0 1 0 0 1 0 0 0 1 1 0 1 1 1 0 0 0 1 0 1 0 1 0 0 0 1 0 1 1 0 0 1 0 0 1 1 1 1 1 0 1 0 0 0 1 0 0 1 1 0 1 0 0 0 0 0 0 1 0 1 0 1 1 1 1 1 1 1 0 0 0 0 0 0 1 0 1 0 1 0 1 1 1 1 1 1 0 0 1 0 0 1 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 1 0 1 1 0 0 1 0 0 0 1 0 0 0 1 1 0 0 0 0 1 0 0 1 1 0 1 1 1 1 1 0 0 1 1 1 0 0 0 1 0 1 0 0 0 1 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 1 0 1 0 0 0 0 1 1 0 0 1 0 1 0 1 0 1 1 0 0 0 1 0 0 1 0 1 0 0 0 1 0 1 1 1 0 0 1 0 0 0 0 1 1 1 0 0 1 1 1 0 1 0 0 0 0 1 0 1 1 1 1 0 1 1 1 0 1 1 0 1 1 0 0 1 0 1 0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 1 1 0 1 1 0 1 0 1 0 0 0 0 0 0 1 0 0 1 0 1 1 1 0 0 1 1 0 1 1 0 1 1 1 1 1 1 0 1 1 0 1 0 1 1 0 0 0 1 0 1 0 0 0 1 0 0 1 1 0 0 0 0 1 1 0 0 0 1 1 1 1 0 0 0 0 1 0 1 1 0 1 0 1 1 1 0 1 0 0 0 0 0 1 1 1 0 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 0 0 0 1 1 1 1 0 0 1 1 1 1 1 0 1 0 1 0 1 1 1 0 1 0 1 1 0 0 0 1 1 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 1 1 0 0 1 0 1 1 0 0 1 1 1 1 1 0 1 0 1 0 1 0 0 1 0 0 1 1 1 1 0 1 1 0 0 0 1 0 1 1 1 1 0 0 0 1 1 1 0 0 1 1 1 1 0 0 1 1 0 1 1 0 1 1 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 1 0 1 0 1 1 1 1 1 0 0 0 0 1 1 0 1 1 0 0 1 1 1 0 0 0 1 0 0 0 1 1 0 0 1 1 0 1 1 1 1 1 1 0 0 1 0 0 1 0 0 1 0 1 1 1 0 0 0 0 1 1 1 1 0 0 0 1 1 1 1 1 0 1 0 0 1 0 1 1 0 1 0 1 0 1 0 1 1 1 0 1 1 0 1 1 1 0 0 0 1 1 0 0 0 1 0 0 0 1 0 1 1 0 1 1 0 0 0 1 1 1 1 1 0 0 0 1 1 1
2 496 718
4 706 758
5
*/
/*
1000 6
1 1 0 1 0 1 1 0 1 1 0 0 0 0 1 0 1 0 0 0 1 0 1 1 1 0 0 1 0 0 1 1 0 0 0 1 1 0 1 1 1 1 0 1 0 1 1 1 0 0 0 1 1 0 0 1 0 1 0 1 1 1 0 0 1 1 0 1 0 0 0 0 1 1 0 1 1 0 0 1 1 1 1 1 0 0 0 0 1 1 0 0 0 1 0 1 1 0 1 0 1 0 1 0 0 1 1 1 1 0 0 0 1 0 0 0 1 1 1 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 0 0 0 1 1 0 1 0 1 1 0 0 0 0 0 0 0 1 0 1 1 1 0 1 1 0 0 0 1 1 0 0 1 0 0 1 1 1 0 1 0 0 1 1 1 0 0 0 1 1 0 0 1 1 0 0 1 1 1 0 1 0 1 1 1 1 1 0 1 1 1 1 0 1 0 1 0 1 1 1 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 0 1 1 0 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 0 0 1 0 1 1 0 0 1 1 1 1 1 1 0 1 0 0 1 0 1 0 0 1 1 1 1 1 1 0 0 1 0 1 0 1 0 1 1 0 1 0 1 0 0 0 1 0 0 1 0 0 0 1 1 0 1 1 1 0 0 0 1 0 1 0 1 0 0 0 1 0 1 1 0 0 1 0 0 1 1 1 1 1 0 1 0 0 0 1 0 0 1 1 0 1 0 0 0 0 0 0 1 0 1 0 1 1 1 1 1 1 1 0 0 0 0 0 0 1 0 1 0 1 0 1 1 1 1 1 1 0 0 1 0 0 1 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 1 0 1 1 0 0 1 0 0 0 1 0 0 0 1 1 0 0 0 0 1 0 0 1 1 0 1 1 1 1 1 0 0 1 1 1 0 0 0 1 0 1 0 0 0 1 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 1 0 1 0 0 0 0 1 1 0 0 1 0 1 0 1 0 1 1 0 0 0 1 0 0 1 0 1 0 0 0 1 0 1 1 1 0 0 1 0 0 0 0 1 1 1 0 0 1 1 1 0 1 0 0 0 0 1 0 1 1 1 1 0 1 1 1 0 1 1 0 1 1 0 0 1 0 1 0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 1 1 0 1 1 0 1 0 1 0 0 0 0 0 0 1 0 0 1 0 1 1 1 0 0 1 1 0 1 1 0 1 1 1 1 1 1 0 1 1 0 1 0 1 1 0 0 0 1 0 1 0 0 0 1 0 0 1 1 0 0 0 0 1 1 0 0 0 1 1 1 1 0 0 0 0 1 0 1 1 0 1 0 1 1 1 0 1 0 0 0 0 0 1 1 1 0 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 0 0 0 1 1 1 1 0 0 1 1 1 1 1 0 1 0 1 0 1 1 1 0 1 0 1 1 0 0 0 1 1 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 1 1 0 0 1 0 1 1 0 0 1 1 1 1 1 0 1 0 1 0 1 0 0 1 0 0 1 1 1 1 0 1 1 0 0 0 1 0 1 1 1 1 0 0 0 1 1 1 0 0 1 1 1 1 0 0 1 1 0 1 1 0 1 1 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 1 0 1 0 1 1 1 1 1 0 0 0 0 1 1 0 1 1 0 0 1 1 1 0 0 0 1 0 0 0 1 1 0 0 1 1 0 1 1 1 1 1 1 0 0 1 0 0 1 0 0 1 0 1 1 1 0 0 0 0 1 1 1 1 0 0 0 1 1 1 1 1 0 1 0 0 1 0 1 1 0 1 0 1 0 1 0 1 1 1 0 1 1 0 1 1 1 0 0 0 1 1 0 0 0 1 0 0 0 1 0 1 1 0 1 1 0 0 0 1 1 1 1 1 0 0 0 1 1 1
2 894 952
1 902 924
2 496 718
4 159 328
3 430 951
4 706 758
6
282
5
*/
int main()
{
// IOS;
t=1;
// cin>>t;
while(t--)
solve();
/******************/
/*while(L<q[i].l) */
/* del(a[L++]);*/
/*while(L>q[i].l) */
/* add(a[--L]);*/
/*while(R<q[i].r) */
/* add(a[++R]);*/
/*while(R>q[i].r) */
/* del(a[R--]);*/
/******************/
QwQ;
}
/*
*/
/*
100 16
0 0 1 1 1 1 1 1 1 1 0 0 1 0 0 1 1 1 0 1 0 1 1 0 1 0 1 0 1 0 0 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 0 1 0 0 1 0 1 1 0 1 1 0 0 0 1 1 1 1 1 0 0 1 1 1 0 0 0 1 1 0 0 1 1 1 0 1 1 1 0 1 0 1 1 1 0 0 1 0 1
1 48 66
0 62 92
0 25 29
2 64 81
2 3 36
3 6 33
1 9 38
0 63 85
2 22 48
2 38 71
4 94 94
4 56 84
0 44 93
0 38 61
1 27 43
4 51 96
15
1
10
1
*/
/*
100 4
0 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 1 1 1 1 1 0 0 0 0 0 0 0 1 0 0 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 0 1 1 0 1 0 1 1 0 0 1 0 1 0 0 0 1 1 0 0 1 0 0 0 1 1 1 1 1 0 1 0 1 0 0 0 0 1 1 1 1 1 0 1 1 0
2 36 46
4 76 89
1 76 97
4 42 67
5
6
*/
/*
10 10
1 0 1 0 1 1 0 0 1 1
2 7 7
2 2 9
4 8 9
0 7 7
1 8 8
1 1 9
2 3 9
0 8 8
4 3 4
1 8 8
0
0
*/
/*
10 10
1 0 1 1 1 0 0 0 0 0
3 4 5
1 2 5
4 4 4
0 8 9
0 7 8
1 6 7
4 5 9
1 2 6
4 0 5
3 9 9
1
1
3
4
0
*/
/*
10 10
0 0 1 1 1 1 1 0 0 0
0 1 3
3 1 9
2 4 9
1 3 7
0 1 4
1 3 7
1 0 0
2 3 4
2 4 7
4 2 9
3
2
*/
/*
20 20
0 1 1 1 0 1 1 1 1 0 1 1 1 1 0 1 1 0 0 0
4 5 8
4 1 8
4 7 7
4 0 8
3 3 6
4 0 8
1 0 9
3 0 2
2 6 9
0 3 7
1 0 8
0 2 4
2 9 9
3 3 3
0 0 7
1 1 6
1 1 4
1 0 6
3 4 8
3 1 7
4
4
1
4
3
4
3
0
4
6
*/
最需要注意的就是操作
若您使用分块做法,将块长调为 pow(sqrt(n),0.66)
后食用以下几组数据效果更佳。
1:
in:
1000 6
1 1 0 1 0 1 1 0 1 1 0 0 0 0 1 0 1 0 0 0 1 0 1 1 1 0 0 1 0 0 1 1 0 0 0 1 1 0 1 1 1 1 0 1 0 1 1 1 0 0 0 1 1 0 0 1 0 1 0 1 1 1 0 0 1 1 0 1 0 0 0 0 1 1 0 1 1 0 0 1 1 1 1 1 0 0 0 0 1 1 0 0 0 1 0 1 1 0 1 0 1 0 1 0 0 1 1 1 1 0 0 0 1 0 0 0 1 1 1 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 0 0 0 1 1 0 1 0 1 1 0 0 0 0 0 0 0 1 0 1 1 1 0 1 1 0 0 0 1 1 0 0 1 0 0 1 1 1 0 1 0 0 1 1 1 0 0 0 1 1 0 0 1 1 0 0 1 1 1 0 1 0 1 1 1 1 1 0 1 1 1 1 0 1 0 1 0 1 1 1 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 0 1 1 0 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 0 0 1 0 1 1 0 0 1 1 1 1 1 1 0 1 0 0 1 0 1 0 0 1 1 1 1 1 1 0 0 1 0 1 0 1 0 1 1 0 1 0 1 0 0 0 1 0 0 1 0 0 0 1 1 0 1 1 1 0 0 0 1 0 1 0 1 0 0 0 1 0 1 1 0 0 1 0 0 1 1 1 1 1 0 1 0 0 0 1 0 0 1 1 0 1 0 0 0 0 0 0 1 0 1 0 1 1 1 1 1 1 1 0 0 0 0 0 0 1 0 1 0 1 0 1 1 1 1 1 1 0 0 1 0 0 1 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 1 0 1 1 0 0 1 0 0 0 1 0 0 0 1 1 0 0 0 0 1 0 0 1 1 0 1 1 1 1 1 0 0 1 1 1 0 0 0 1 0 1 0 0 0 1 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 1 0 1 0 0 0 0 1 1 0 0 1 0 1 0 1 0 1 1 0 0 0 1 0 0 1 0 1 0 0 0 1 0 1 1 1 0 0 1 0 0 0 0 1 1 1 0 0 1 1 1 0 1 0 0 0 0 1 0 1 1 1 1 0 1 1 1 0 1 1 0 1 1 0 0 1 0 1 0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 1 1 0 1 1 0 1 0 1 0 0 0 0 0 0 1 0 0 1 0 1 1 1 0 0 1 1 0 1 1 0 1 1 1 1 1 1 0 1 1 0 1 0 1 1 0 0 0 1 0 1 0 0 0 1 0 0 1 1 0 0 0 0 1 1 0 0 0 1 1 1 1 0 0 0 0 1 0 1 1 0 1 0 1 1 1 0 1 0 0 0 0 0 1 1 1 0 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 0 0 0 1 1 1 1 0 0 1 1 1 1 1 0 1 0 1 0 1 1 1 0 1 0 1 1 0 0 0 1 1 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 1 1 0 0 1 0 1 1 0 0 1 1 1 1 1 0 1 0 1 0 1 0 0 1 0 0 1 1 1 1 0 1 1 0 0 0 1 0 1 1 1 1 0 0 0 1 1 1 0 0 1 1 1 1 0 0 1 1 0 1 1 0 1 1 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 1 0 1 0 1 1 1 1 1 0 0 0 0 1 1 0 1 1 0 0 1 1 1 0 0 0 1 0 0 0 1 1 0 0 1 1 0 1 1 1 1 1 1 0 0 1 0 0 1 0 0 1 0 1 1 1 0 0 0 0 1 1 1 1 0 0 0 1 1 1 1 1 0 1 0 0 1 0 1 1 0 1 0 1 0 1 0 1 1 1 0 1 1 0 1 1 1 0 0 0 1 1 0 0 0 1 0 0 0 1 0 1 1 0 1 1 0 0 0 1 1 1 1 1 0 0 0 1 1 1
2 894 952
1 902 924
2 496 718
4 159 328
3 430 951
4 706 758
out:
6
282
5
2:
in:
100 16
0 0 1 1 1 1 1 1 1 1 0 0 1 0 0 1 1 1 0 1 0 1 1 0 1 0 1 0 1 0 0 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 0 1 0 0 1 0 1 1 0 1 1 0 0 0 1 1 1 1 1 0 0 1 1 1 0 0 0 1 1 0 0 1 1 1 0 1 1 1 0 1 0 1 1 1 0 0 1 0 1
1 48 66
0 62 92
0 25 29
2 64 81
2 3 36
3 6 33
1 9 38
0 63 85
2 22 48
2 38 71
4 94 94
4 56 84
0 44 93
0 38 61
1 27 43
4 51 96
out:
15
1
10
1
3:
in:
100 4
0 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 1 1 1 1 1 0 0 0 0 0 0 0 1 0 0 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 0 1 1 0 1 0 1 1 0 0 1 0 1 0 0 0 1 1 0 0 1 0 0 0 1 1 1 1 1 0 1 0 1 0 0 0 0 1 1 1 1 1 0 1 1 0
2 36 46
4 76 89
1 76 97
4 42 67
out:
5
6
4:
in:
10 10
1 0 1 0 1 1 0 0 1 1
2 7 7
2 2 9
4 8 9
0 7 7
1 8 8
1 1 9
2 3 9
0 8 8
4 3 4
1 8 8
out:
0
0
5:
in:
10 10
1 0 1 1 1 0 0 0 0 0
3 4 5
1 2 5
4 4 4
0 8 9
0 7 8
1 6 7
4 5 9
1 2 6
4 0 5
3 9 9
out:
1
1
3
4
0
6:
in:
10 10
0 0 1 1 1 1 1 0 0 0
0 1 3
3 1 9
2 4 9
1 3 7
0 1 4
1 3 7
1 0 0
2 3 4
2 4 7
4 2 9
out:
3
2
7:
in:
20 20
0 1 1 1 0 1 1 1 1 0 1 1 1 1 0 1 1 0 0 0
4 5 8
4 1 8
4 7 7
4 0 8
3 3 6
4 0 8
1 0 9
3 0 2
2 6 9
0 3 7
1 0 8
0 2 4
2 9 9
3 3 3
0 0 7
1 1 6
1 1 4
1 0 6
3 4 8
3 1 7
out:
4
4
1
4
3
4
3
0
4
6
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 为DeepSeek添加本地知识库
· 精选4款基于.NET开源、功能强大的通讯调试工具
· DeepSeek智能编程
· 大模型工具KTransformer的安装
· [计算机/硬件/GPU] 显卡