POJ1247解题报告

  

Magnificent Meatballs

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 5202		Accepted: 3515

Description

Sam and Ella run a catering service. They like to put on a show when serving meatballs to guests seated at round tables. They march out of the kitchen with pots of meatballs and start serving adjacent guests. Ella goes counterclockwise and Sam goes clockwise, until they both plop down their last meatball, at the same time, again at adjacent guests. This impressive routine can only be accomplished if they can divide the table into two sections, each having the same number of meatballs. You are to write a program to assist them.

At these catering events, each table seats 2 <= N <= 30 guests. Each guest orders at least one and at most nine meatballs. Each place at the table is numbered from 1 to N, with the host at position 1 and the host's spouse at position N. Sam always serves the host first then proceeds to serve guests in increasing order. Ella serves the spouse first, then serves guests in decreasing order. The figures illustrate the first two example input cases.

Input

Input consists of one or more test cases. Each test case contains the number of guests N followed by meatballs ordered by each guest, from guest 1 to guest N. The end of the input is a line with a single zero.

Output

For each table, output a single line with the ending positions for Sam and Ella, or the sentence indicating an equal partitioning isn't possible. Use the exact formatting shown below.

Sample Input

5 9 4 2 8 3
5 3 9 4 2 8
6 1 2 1 2 1 2
6 1 2 1 2 1 1
0

Sample Output

Sam stops at position 2 and Ella stops at position 3.
No equal partitioning.
No equal partitioning.
Sam stops at position 3 and Ella stops at position 4.

就是求当两个人按顺时针方向和按逆时针方向放置肉丸子后，当两个人肉丸子相等时所处的位置。

写了个O（n*n）的算法，囧。

import java.util.*;
public class Main {

	//客人，客人的数目为2~30
	private int[] guests=new int[31];
	//客人的数目
	private int num;
	
	//清空
	public void init()
	{
		for(int i=0;i<=30;i++)
		{
			guests[i]=0;
		}
	}
	
	//构造函数
	public Main()
	{
		Scanner scan=new Scanner(System.in);
		while((num=scan.nextInt())!=0)
		{
			init();
			
			for(int i=1;i<=num;i++)
			{
				guests[i]=scan.nextInt();
			}
			
			//Sam发送的肉丸子数
			int sum1=0;
			//Ella发送的肉丸子数
			int sum2=0;
			boolean tag=true;
			for(int i=1;i<num;i++)
			{
				//i是Sam走的步数
				int m,n;
				sum1=0;
				sum2=0;
				for(m=1;m<=i;m++)
				{
					sum1+=guests[m];
				}
				//System.out.println("m="+(m-1)+" sum1="+sum1);
				for(n=i+1;n<=num;n++)
				{
					sum2+=guests[n];
				}
				//System.out.println("n="+(n-1)+" sum2="+sum2);
				if(sum1==sum2)
				{
					System.out.println("Sam stops at position "+i+" and Ella stops at position "+(i+1)+".");
					tag=false;
					break;
				}
			}
			if(tag){
				System.out.println("No equal partitioning.");
			}
		}
	}
	public static void main(String[] args)
	{
		Main mainf=new Main();
	}
}