Codeforces 895A - 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:

Both red and green sectors consist of two adjacent pieces of pizza. So Vasya can take green sector, then Petya will take red sector.

题目意思：
就是一个圆被分成n个扇形，给出每个扇形的角度，现在把这些扇形按给出的顺序分成两个大的扇形，然后求这两个扇形的角度差的最小值。

题解：
刚开始做以为是背包，一直WA，重点是按顺序分成两个扇形，这要求要按照给出的顺序连着分成两个，例如：

170 30 150 10
这个可以分成 170 + 30 和 150 + 10，但是不能分成170 + 150 和 30 + 10；
所以这道题只要用两个for循环，暴力枚举就可以了。
下面代码

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<math.h>
using namespace std;

int main(){
	int n;
	while(~scanf("%d",&n)){
		int a[500],minn = 9999999;
		for(int i = 1;i <= n;i++){
			scanf("%d",&a[i]);
		}
		for(int i = 1;i <= n;i++){
			int t = 0;
			for(int j = i;j <= n;j++){
				t += a[j];
				minn = min(minn,abs(2 * (180 - t)));
			}
		}
		printf("%d\n",minn);
	}
	return 0;
}