Submission #2212971
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long int ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep2(i,n) for(int i=1;i<=(int)(n);i++) #define rep3(i,n) for(int i=0;i<=(int)(n);i++) #define REP(i,m,n) for(int i=m;i<(int)(n);i++) #define repll(i,n) for(ll i=0;i<(ll)(n);i++) #define repll2(i,n) for(ll i=1;i<=(ll)(n);i++) #define REPLL(i,m,n) for(ll i=m;i<(ll)(n);i++) #define INF 1000000000 // #define LINF (ll)4000000000000000000 // #define MOD (ll)1000000007 #define MP make_pair #define YES(n) cout << ((n) ? "YES" : "NO" ) << endl #define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl #define PI 3.1415926535898 #define NP(v) next_permutation(v.begin(),v.end()) //------------------------------------------------------ int main() { int n; cin >> n; int a[n]; rep(i, n) cin >> a[i]; int MaxT = -INF; rep(taka, n) { int MaxA = -INF; int MaxT_sub = -INF; rep(aoki, n) { if (taka == aoki) continue; int taka_s = taka; int aoki_s = aoki; if (taka_s > aoki_s) swap(taka_s, aoki_s); int taka_p = 0; int aoki_p = 0; REP(i, taka_s, aoki_s + 1) { if ((i - taka_s) % 2 == 0) taka_p += a[i]; else aoki_p += a[i]; } if (aoki_p > MaxA) { MaxA = aoki_p; MaxT_sub = taka_p; } } MaxT = max(MaxT, MaxT_sub); } cout << MaxT << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 数列ゲーム |
User | stoq |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1647 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | sample-01.txt, sample-02.txt, sample-03.txt, test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |
test-01.txt | AC | 1 ms | 256 KB |
test-02.txt | AC | 1 ms | 256 KB |
test-03.txt | AC | 1 ms | 256 KB |
test-04.txt | AC | 1 ms | 256 KB |
test-05.txt | AC | 1 ms | 256 KB |
test-06.txt | AC | 1 ms | 256 KB |
test-07.txt | AC | 1 ms | 256 KB |
test-08.txt | AC | 1 ms | 256 KB |
test-09.txt | AC | 1 ms | 256 KB |
test-10.txt | AC | 1 ms | 256 KB |
test-11.txt | AC | 1 ms | 256 KB |
test-12.txt | AC | 1 ms | 256 KB |
test-13.txt | AC | 1 ms | 256 KB |
test-14.txt | AC | 1 ms | 256 KB |
test-15.txt | AC | 1 ms | 256 KB |
test-16.txt | AC | 1 ms | 256 KB |
test-17.txt | AC | 1 ms | 256 KB |
test-18.txt | AC | 1 ms | 256 KB |
test-19.txt | AC | 1 ms | 256 KB |
test-20.txt | AC | 1 ms | 256 KB |