提出 #29068572

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define per(i, a, b) for(int i = (b)-1; i >= (a); --i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pii> vii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);

  int n;
  cin >> n;

  vi cuts = {0};
  int cur = 0;
  rep(i,0,n) {
    int x;
    cin >> x;
    cur += x;
    cur %= 360;
    cuts.pb(cur);
  }
  sort(all(cuts));
  int ans = 0;
  rep(i,1,sz(cuts)) ckmax(ans, cuts[i] - cuts[i-1]);
  ckmax(ans, 360 - cuts.back());
  cout << ans << '\n';
}

提出情報

ジャッジ結果