[水]ZOJ1402

给一个数环，取一个x，问是否存在一个x使得sum[a[1]....a[x]]==sum[a[x+1]...a[n]]

前缀和搞一下就好

#include<bits/stdc++.h>

using namespace std;
int n;
void Gao()
{
    int a[50]={0};
    for (int i=1;i<=n;i++)
    {
        cin>>a[i];
        a[i]+=a[i-1];
    }
    if (a[n]&1==1)
    {
        cout<<"No equal partitioning."<<endl;
        return;
    }
    else
    {
        for (int i=1;i<=n-1;i++)
            if (a[i]==a[n]/2)
            {
                printf("Sam stops at position %d and Ella stops at position %d.\n",i,i+1);
                return ;
            }
        cout<<"No equal partitioning."<<endl;
    }
}
int main()
{
    //freopen("a.in","r",stdin);
    while(cin>>n &&n)
        Gao();
    return 0;
}