51nod 1396 还是01串

#include <bits/stdc++.h>
using namespace std;

string str;
int sum1[1000100],sum0[1000100];

int main()
{
	int i,s1,s0,ans;
	while(cin>>str)
	{
		sum1[0]=(str[0]-'0'?1:0);
		sum0[0]=(str[0]-'0'?0:1);
		for(i=1;i<str.length();i++)
		{
			sum1[i]=sum1[i-1];
			sum0[i]=sum0[i-1];
			if(str[i]-'0')
				sum1[i]++;
			else
				sum0[i]++;
		}
		ans=-1;
		for(i=0;i<=str.length();i++)
		{
			if(i==0)
				s0=0;
			else
				s0=sum0[i-1];
			if(i==str.length())
				s1=0;
			else
				s1=sum1[str.length()-1]-(i>0?sum1[i-1]:0);
			if(s0==s1)
			{
				ans=i;
				break;
			}
		}
		printf("%d\n",ans);
	}
}