Submission #1833006
Source Code Expand
#include <bits/stdc++.h>
#include <algorithm>
#include <stdio.h>
#include <math.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,P> PP;
struct edge {
int to,cost;
edge(int t,ll c):to(t),cost(c) {}
};
int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
int ddx[]={1,1,1,0,-1,-1,-1,0},ddy[]={1,0,-1,-1,-1,0,1,1};
ll mypow(ll x,ll n,ll m) {
if(n==0) return 1;
if(n%2==0) return mypow(x*x%m,n/2,m);
else return x*mypow(x,n-1,m)%m;
}
//-----------------------------------------------------------------------------
int n,a[50];
int ans=-INF;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
REP(i,n) cin>>a[i];
REP(i,n) {
int A=-INF,B=-INF;
REP(j,n) {
if(i==j) continue;
int l=min(i,j),r=max(i,j);
int aa=0,bb=0;
FOR(k,l,r+1) {
if((k-l)&1) bb+=a[k];
else aa+=a[k];
}
if(bb>B) A=aa,B=bb;
}
ans=max(ans,A);
}
cout<<ans<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 数列ゲーム |
User |
moko_freedom |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1254 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 |