Codeforces895A. Pizza Separation

最新推荐文章于 2019-07-20 10:56:22 发布

原创最新推荐文章于 2019-07-20 10:56:22 发布 · 980 阅读

0 ·

CC 4.0 BY-SA版权

Codeforces 同时被 2 个专栏收录

82 篇文章

订阅专栏

----暴力

2 篇文章

订阅专栏

探讨了如何将一个已切割成n块的圆形比萨分成两个连续的扇形区域，使得这两个区域的角度之差最小。通过遍历所有可能的分区方式来找到最优解。

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:

$\text{[math]}$

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

———————————————————————————————————————————————————————————

题目的意思是给你一个序列找出一个区间是的它的和与剩下的所有数的和差值最小，求

差值

思路：暴力枚举所有区间内

#include <bits/stdc++.h>

using namespace std;

int main()
{
   int a[400];
   int n;
   while(~scanf("%d",&n))
   {
      for(int i=0;i<n;i++)
      {
          scanf("%d",&a[i]);
      }
      int mn=360;
      for(int i=0;i<n;i++)
      {
           int sum=0;
        for(int j=i;j<n;j++)
        {
            sum+=a[j];

            mn=min(mn,abs(360-2*sum));
        }
      }
      printf("%d\n",mn);
   }
    return 0;
}