codeforces 解题报告 895A. Pizza Separation brute force

http://codeforces.com/problemset/problem/895/A

解题思路：

1.暴力枚举所有连续的段，维护答案

import java.util.Scanner;

public class Main {

    public static void main(String args[]) {

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] pizza = new int[400];
        for(int i = 0;i < n;i++) {
            pizza[i] = sc.nextInt();
        }

        int ans = 360;
        for(int i = 0;i < n;i++) {
            int temp = 0,j = i;
            while (temp < 180) {
                temp += pizza[(j % n)];
                j++;
                ans = Math.min(ans,Math.abs(180 - temp));
            }
            ans = Math.min(ans,Math.abs(temp - 180));
        }

        System.out.println(ans * 2);
    }
}