128、苏苏的01字符串.docx

AC_Code

C++

#includebits/stdc++.h

usingnamespacestd;

#defineintlonglong

constintmod=1e9+7;

intQuickPow(intx,intpow,intp)

{

intres=1;

if(p)x%=p;

while(pow){

if(pow1){

if(p)res=(res*x)%p;

elseres=res*x;

}

if(p)x=(x*x)%p;

elsex=x*x;

pow=1;

}

if(p)returnres%p;

returnres;

}

constintN=1e6+7;

intdp[N];

voidsolve()

{

intn;

cinn;

strings;

cins;

s=+s;

intinv2=QuickPow(2,mod-2,mod);

intcnt=0;//cnt表示字符中当前连续的1的长度

for(inti=1;i=n;++i){

if(s[i]==0){

dp[i]=dp[i-1];

cnt=0;

}

elseif(s[i]==1){

dp[i]=(dp[i-1]+(2*cnt%mod+1)%mod)%mod;

cnt=(cnt+1)%mod;

}

else{

dp[i]=(dp[i-1]+(2*cnt%mod+1)*inv2%mod)%mod;

cnt=(cnt+1)*inv2%mod;

}

}

coutdp[n]\n;

return;

}

signedmain()

{

srand((int)time(0));

ios::sync_with_stdio(false);

cin.tie(nullptr),cout.tie(nullptr);

int_=1;

//cin_;

while(_--){

solve();

}

return0;

}

Java

importjava.io.*;

importjava.util.Scanner;

publicclassMain{

staticintmod=(int)1e9+7;

staticlongquickPow(longx,longpow,longp){

longres=1;

if(p!=0)x%=p;

while(pow0){

if((pow1)==1){

if(p!=0)res=(long)(((long)res*x)%p);

elseres=res*x;

}

if(p!=0)x=(long)(((long)x*x)%p);

elsex=x*x;

pow=1;

}

if(p!=0)returnres%p;

returnres;

}

publicstaticvoidsolve(){

Scannerscanner=newScanner(System.in);

intn=scanner.nextInt();

Strings=scanner.next();

s=+s;