Submission #2175266
Source Code Expand
#include <cstdio> #include <iostream> #include <string> #include <vector> #include <sstream> #include <map> #include <set> #include <queue> #include <algorithm> #include <cmath> #include <cstdlib> #include <cstring> #include <typeinfo> #include <numeric> #include <functional> #include <unordered_map> using namespace std; using ll = long long; using ull = unsigned long long; const ll INF = 1e9; const ll MOD = 1e9 + 7; #define REP(i, n) for(int i = 0; i < n; i++) #define RREP(i, n) for(int i = n - 1; i >= 0; i--) #define REP2(i, n, k) for(int i = 0; i < n; i += k) int n, a[50]; int aoki(int p){ int ao = -INF, taka = -INF; REP(i, n){ if(i != p){ int t1 = 0, t2 = 0; if(i < p){ for(int j = i; j <= p; j += 2){ t1 += a[j]; } for(int j = i + 1; j <= p; j += 2){ t2 += a[j]; } if(ao < t2){ ao = t2; taka = t1; } } else{ for(int j = p; j <= i; j += 2){ t1 += a[j]; } for(int j = p + 1; j <= i; j += 2){ t2 += a[j]; } if(ao < t2){ ao = t2; taka = t1; } } } } return taka; } int main() { cin >> n; REP(i, n){ cin >> a[i]; } int ans = -INF; REP(i, n){ ans = max(ans, aoki(i)); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 数列ゲーム |
User | chocobo |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1728 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 |