Submission #7067992
Source Code Expand
#include <bits/stdc++.h> #define int long #define ll long long #define rep(i, n) for(int i = 0; i < n; i++) using namespace std; 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;} main() { int N; cin >> N; int A[N],B[N]; rep(i,N) cin >> A[i]; rep(i,N) cin >> B[i]; int AS[N],BS[N]; rep(i,N){ if(!i) AS[i]=A[i]; else { AS[i]=A[i]+AS[i-1]; } } for(int i=N-1;i>=0;i--){ if(i==N-1) BS[N-1-i]=B[i]; else{ BS[N-1-i]=B[i]+BS[N-i-2]; } } int ans=0; rep(i,N){ if(!i) ans=BS[N-1]+AS[0]; else { ans=max(ans,BS[N-1-i]+AS[i]); } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Candies |
User | paotan |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 790 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 |