// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
// using P = pair<ll,ll>;
using P = pair<int,int>;
using vint = vector<int>;
using vll = vector<ll>;
using vvint = vector<vector<int>>;
using vvll = vector<vector<ll>>;
// const ll INF = (ll)2e18+9;
const int INF = (int)2e9+7;
// const ll MOD = (ll)1e9+9;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }
template<typename T>
void print(vector<T> v) {
int n = v.size();
rep(i,n) {
if (i == 0) cout << v[i];
else cout << ' ' << v[i];
}
cout << endl;
}
void solve() {
int n;
cin >> n;
int now = 0;
vint angles = {0, 360};
rep(i,n) {
int a;
cin >> a;
now = (now + a) % 360;
angles.push_back(now);
}
sort(all(angles));
int ans = 0;
rep2(i,1,angles.size()) {
chmax(ans, angles[i] - angles[i-1]);
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
./Main.cpp: In function ‘void solve()’:
./Main.cpp:9:41: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
9 | #define rep2(i,k,n) for (int i = (k); i < (n); ++i)
| ^
./Main.cpp:50:5: note: in expansion of macro ‘rep2’
50 | rep2(i,1,angles.size()) {
| ^~~~