Submission #1673651


Source Code Expand

#include <bits/stdc++.h>
#define INF 1e9
using namespace std;

int main(){

  int n;
  int a[51];

  cin >> n;
  for(int i = 0; i < n; i++) cin >> a[i];

  int ans = -INF;
  for(int i = 0; i < n; i++){
    pair<int, int> maxp(-INF, -INF);
    for(int j = 0; j < n; j++){
      if(i == j) continue;
      pair<int, int> p;
      int left = min(i, j), right = max(i, j);
      for(int k = left; k <= right; k++){
        if((k-left+1) % 2) p.first += a[k];
        else p.second += a[k];
      }
      if(maxp.second < p.second) maxp = p;
    }
    ans = max(ans, maxp.first);
  }

  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task C - 数列ゲーム
User swkfn
Language C++14 (GCC 5.4.1)
Score 100
Code Size 648 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 23
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