zoj-4054 Traveling on the Axis

题目链接

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
ll f[100005];
ll sum[100005];
int main()
{
    ll t;
    while(cin>>t)
    {
        while(t--)
        {
            char s[100005];
            cin>>s;
            int len=strlen(s);
            sum[0]=0;
            for(int i=0;i<len;i++)
            {
                if(sum[i]%2==0)
                {
                    if(s[i]=='1')sum[i+1]=sum[i]+1;
                    else sum[i+1]=sum[i]+2;
                }else
                {
                    if(s[i]=='1')sum[i+1]=sum[i]+2;
                    else sum[i+1]=sum[i]+1;
                }
            }
            f[0]=0;
            for(int i=1;i<=len;i++)
                f[i]=f[i-1]+sum[i];
            ll ans=f[len];
            for(int i=2;i<=len;i++)
            {
                int num=len-i+1;
                if(s[i-1]=='1')ans+=1*num;
                    else ans+=2*num;
                ans+=f[len]-f[i-1]-sum[i]*(len-(i-1));
            }
            printf("%lld\n",ans);
        }
    }
    return 0;
}