A. Pizza Separation（披萨分离）（简单枚举法）

A. Pizza Separation

			time limit per test1 second
			memory limit per test256 megabytes
			inputstandard input
			outputstandard output.

Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into n pieces. The i-th piece is a sector of angle equal to ai. Vasya and Petya want to divide all pieces of pizza into two continuous sectors in such way that the difference between angles of these sectors is minimal. Sector angle is sum of angles of all pieces in it. Pay attention, that one of sectors can be empty.

Input
The first line contains one integer n (1 ≤ n ≤ 360) — the number of pieces into which the delivered pizza was cut.

The second line contains n integers ai (1 ≤ ai ≤ 360) — the angles of the sectors into which the pizza was cut. The sum of all ai is 360.

Output
Print one integer — the minimal difference between angles of sectors that will go to Vasya and Petya.

Examples

input
4
90 90 90 90
output
0
input
3
100 100 160
output
40
input
1
360
output
360
input
4
170 30 150 10
output
0

Note

In first sample Vasya can take 1 and 2 pieces, Petya can take 3 and 4 pieces. Then the answer is |(90 + 90) - (90 + 90)| = 0.
————————————————————————————
In third sample there is only one piece of pizza that can be taken by only one from Vasya and Petya. So the answer is |360 - 0| = 360.
————————————————————————————
In fourth sample Vasya can take 1 and 4 pieces, then Petya will take 2 and 3 pieces. So the answer is |(170 + 10) - (30 + 150)| = 0.

Picture explaning fourth sample:

题目来源：A. Pizza Separation.

题目分析

这个题目实际上就是在一段“连续”的数列中，找出和最接近180的数，设A饼的和为sum,B饼就是360-sum实际上答案就是:abs(A-B)=abs(360-2sum),那我们的问题就转化为求abs(360-2sum)的最小值。

AC代码

#include <iostream>
#include <algorithm>
#include <string.h>
#include <math.h>
using namespace std;
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		int a[400];
		memset(a,0,sizeof(a));
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
		}
		int ans = 360,sum = 0; 
		for (int i=0;i<n;i++)
		{
			sum = 0;
			for (int j=i;j<n;j++)
			{
				sum += a[j];
				ans = min(ans,abs(360-sum*2));
			}
		}
		printf("%d\n",ans);
	}
    return 0;
}

其他

如果不是连续的一段数求答案的话，应该使用dp算法。