Submission #2851692
Source Code Expand
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(b);i>(a);--i)
#define eper(i,a,b) for(int i=((int)(a));i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF 2000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}
int n, ans = -INF;
vector<int> a;
int main() {
ios::sync_with_stdio ( false );
cin.tie ( 0 );
cin >> n;
a.resize(n);
rep(i, 0, n) cin >> a[i];
rep(i, 0, n) {
int ans_tak = -3000, ans_aok = -3000;
rep(j, 0, n) {
if (i == j) continue;
int l = min(i, j), r = max(i, j);
int tak = 0, aok = 0;
for (int k = l; k <= r; k++) {
if ((k-l)%2) aok += a[k];
else tak += a[k];
}
if (ans_aok < aok) {
ans_tak = tak;
ans_aok = aok;
}
}
ans = max(ans, ans_tak);
}
printf("%d\n", ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 数列ゲーム |
User |
kage |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1196 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 |