简单的披萨切分

题目链接：https://atcoder.jp/contests/abc238/tasks/abc238_b
 1 #include <bits/stdc++.h>
using namespace std;
int pizza[720];
int main()
{
    fill(pizza, pizza + 360, 0);
    int kill_n;
    cin >> kill_n;
    int start_n = 0;
    pizza[0] = 1;
    pizza[360] = 1;
    for (int i = 0; i < kill_n; i++)
    {
        int d = 0;
        cin >> d;
        int cnt = (d + start_n)%360;
        pizza[cnt] = 1;
        pizza[cnt+360] = 1;
        start_n += d;
        start_n %= 360;
    }
    int max_l = 0;
    for (int i = 0; i < 720; i++)
    {
        int len = 1;
        if (pizza[i] == 0)
        {
            for (int j = i; j < 720; j++)
            {
                if (pizza[j] == 0)
                {
                    len++;
                }
                else
                {
                    i = j;
                    break;
                }
            }
        }
        max_l = max(len, max_l);
    }
    cout << max_l << endl;
}