Codeforces Round #448 (Div. 2) A

ACM_e發表於2017-11-27

A. Pizza Separation
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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:



注意 要的事連續的   剛開始沒看清題  用了揹包 gg   wa8  之後才看到是連續的



#include<bits/stdc++.h>
using namespace std;
int a[10001]={0};
int b[10001]={0};
int main(){
   int n;
   cin>>n;
   for(int j=1;j<=n;j++){
      cin>>a[j];
      a[n+j]=a[j];
   }
   int l=0,k=1;
   int mi=999;
   for(int j=1;j<=n*2;j++){
      l+=a[j];
      int z=l;
      for(int k=0;k<j;k++){
        z=z-a[k];
        int i=360-z;
        int y=abs(i-z);
        mi=min(y,mi);
      }
   }
   cout<<mi<<endl;
   return 0;
}














相關文章