Submission #2120185
Source Code Expand
#include <algorithm> #include <cstdio> #include <iostream> #include <map> #include <math.h> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <string.h> #include <vector> using namespace std; #define ll long long #define INF (1 << 30) #define INFLL (1LL << 60) #define FOR(i,a,b) for(ll i = (a);i<(b);i++) #define REP(i,a) FOR(i,0,(a)) #define MP make_pair int main() { int n; int a[101][2]; cin >> n; for(int i = 0;i < 2;i++){ for(int j = 0;j < n;j++){ cin >> a[j][i]; } } int sum[101][2] = {}; for(int i = 0;i < n;i++){ if(i != 0) sum[i][0] = a[i][0] + sum[i-1][0]; else sum[i][0] = a[i][0]; } for(int i = n-1;i >= 0;i--){ sum[i][1] = a[i][1] + sum[i+1][1]; } int ans = 0; for(int i = 0;i < n;i++){ ans = max(ans, sum[i][0] + sum[i][1]); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Candies |
User | yasu89 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 905 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample01.txt, sample02.txt, sample03.txt, sample04.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, sample01.txt, sample02.txt, sample03.txt, sample04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
sample01.txt | AC | 1 ms | 256 KB |
sample02.txt | AC | 1 ms | 256 KB |
sample03.txt | AC | 1 ms | 256 KB |
sample04.txt | AC | 1 ms | 256 KB |