pku1247.java

来自「这是ACM 方面的资料 是PKU的 北京大学的出来的」· Java 代码 · 共 38 行

import java.io.*;
import java.util.*;
public class Main
{
	public static void main(String args[]) throws Exception
	{
		Scanner cin=new Scanner(System.in);
		int N,s1,s2,i,i1,i2;
		int num[];
		while(true)
		{
			N=cin.nextInt();
			if(N==0) break;
			num=new int[N];
			for(i=0;i<N;i++)
			{
				num[i]=cin.nextInt();
			}
			for(i1=0,i2=N-1,s1=0,s2=0;i1<=i2;)
			{
				if(s1+num[i1]>s2+num[i2])
				{
					s2+=num[i2];
					i2--;
				}
				else
				{
					s1+=num[i1];
					i1++;
				}
			//	System.out.println(s1+" "+s2);
			}
			if(s1==s2) System.out.println("Sam stops at position "+(i1)+" and Ella stops at position "+(i2+2)+".");
			else System.out.println("No equal partitioning.");
		}
	}
}