题解:
设f[i]表示1~i的期望收益,len[i]表示i尾部连续的'0'期望长度。
若s[i]=='x',则f[i]=f[i-1],len[i]=0,
若s[i]=='o',则f[i]=f[i-1]+len[i-1]*2+1,len[i]=len[i-1]+1,
若s[i]=='?',则f[i]=f[i-1]+(len[i-1]*2+1)/2,len[i]=len[i-1]/2+0.5。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=3e5+4;
double f[MAXN],len[MAXN];
int n;
char s[MAXN];
int main() {
scanf("%d%s",&n,s+1);
for (register int i=1;i<=n;++i) {
if (s[i]=='x') f[i]=f[i-1],len[i]=0;
else if (s[i]=='o') f[i]=f[i-1]+len[i-1]*2+1,len[i]=len[i-1]+1;
else f[i]=f[i-1]+len[i-1]+0.5,len[i]=len[i-1]/2+0.5;
}
printf("%.4lf\n",f[n]);
return 0;
}