Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | import std.stdio,
std.string,
std.conv,
std.algorithm;
void main() {
int N = readln.chomp.to!(int);
int[][] A;
for (int i = 0; i < 2; i++) {
A ~= readln.chomp.split.to!(int[]);
}
int ans;
for (int i = 0; i < N; i++) {
int t, row;
for (int j = 0; j < N; j++) {
if (j... | 158 |
Project_CodeNet | 2,018 | module app;
import std.stdio;
import std.algorithm;
import std.range;
import std.array;
import std.string;
import std.conv;
void main(string[] args) {
// 一行目の入力を捨てる
readln();
int[][] lines = iota(0,2).map!((Unused) => readln.chop.split.map!(to!int).array).array;
auto candies = iota(0,lines[0].length).... | 165 |
Project_CodeNet | 2,018 | import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
int readint() { return readln.chomp.to!int; }
int[] readints() { return readln.split.to!(int[]); }
int calc(int[][] xs) {
int n = cast(int) xs[0].length;
int a... | 236 |
Project_CodeNet | 2,018 | void main(){
import std.stdio, std.string, std.conv, std.algorithm;
int n; rd(n);
auto a=new int[][](2, n);
a[0]=readln.split.to!(int[]);
a[1]=readln.split.to!(int[]);
int mx=0;
foreach(i; 0..n){
int sub=0;
for(auto j=0; j<=i; j++) sub+=a[0][j];
for(auto j=i; j<n; j++) sub+=a[1][j];
mx=m... | 224 |
Project_CodeNet | 2,018 | /+ dub.sdl:
name "C"
dependency "dunkelheit" version=">=0.9.0"
+/
import std.stdio, std.algorithm, std.range, std.conv;
// import dkh.foundation, dkh.scanner;
// import dkh.algorithm;
int main() {
Scanner sc = new Scanner(stdin);
scope(exit) sc.read!true;
int n;
sc.read(n);
int[] a1, a2;... | 2,179 |
Project_CodeNet | 2,020 | N = int(input())
A = [[0]*N for _ in range(2)]
A[0] = list(map(int, input().split()))
A[1] = list(map(int, input().split()))
ans = 0
for i in range(N):
temp = 0
for j in range(i+1):
temp += A[0][j]
for j in range(N-i):
temp += A[1][-(j+1)]
ans = max(ans, temp)
print(ans) | 110 |
Project_CodeNet | 2,018 | N = int(input())
from itertools import accumulate
A = list(map(int,input().split()))
B = list(map(int,input().split()))
B.reverse()
A = list(accumulate(A))
B = list(accumulate(B))
B.reverse()
m = max(a+b for a,b in zip(A,B))
print(m)
| 64 |
Project_CodeNet | 2,018 | import sys
N=int(sys.stdin.readline())
xs = []
s = 0
for x in map(int,sys.stdin.readline().split()):
s += x
xs.append(s)
s = 0
for i, x in enumerate(map(int,sys.stdin.readline().split())):
s = max(s, xs[i]) + x
print(s)
| 75 |
Project_CodeNet | 2,018 | import numpy as np
n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, reversed(input().split())))
cs1 = np.cumsum(a1)
cs2 = np.cumsum(a2)
income = [cs1[i]+cs2[n-1-i] for i in range(n)]
print(max(income)) | 76 |
Project_CodeNet | 2,018 | N = 2
M = input()
a = []
for i in range(N):
a.append(map(int, raw_input().split()))
maxcandy = 0
for i in range(M):
sumcandy = 0
for j in range(i+1):
sumcandy = sumcandy + a[0][j]
for j in range(i,M):
sumcandy = sumcandy + a[1][j]
if maxcandy < sumcandy:
maxcandy = sumcandy
print maxcandy | 115 |
Project_CodeNet | 2,019 | n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
ans = 0
for i in range(1,n+1):
ans = max(ans, sum(a1[:i])+sum(a2[i-1:]))
print(ans) | 65 |
Project_CodeNet | 2,018 | import numpy as np
def inpl(): return [int(i) for i in input().split()]
N = int(input())
A1 = np.cumsum(np.array(inpl()))
A2 = np.cumsum(np.array(inpl()))
ans = A1[0] + A2[-1]
for i in range(1,N):
ans = max(ans, A1[i]+A2[-1]-A2[i-1])
print(ans) | 93 |
Project_CodeNet | 2,018 | # -*- coding: utf-8 -*-
import sys
n = int(raw_input().split()[0])
a1 = [int(i) for i in raw_input().split()]
a2 = [int(i) for i in raw_input().split()]
maxA = 0
for i in range(1, n + 1):
# print i, a1[:i], a2[i - 1:],
s = sum(a1[:i]) + sum(a2[i - 1:])
if s > maxA:
# print '!!!',
maxA = s... | 143 |
Project_CodeNet | 2,018 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
if __name__ == "__main__":
N = int(input())
A = [[int(i) for i in input().split()] for i in range(2)]
SUM = [0 for i in range(N)]
for i in range(N):
for j in range(i+1):
SUM[i] = SUM[i] + A[0][j]
for j in range(i, N):
SUM[i] = SUM[i] + A[1][j]
print(max(S... | 120 |
Project_CodeNet | 2,020 | from itertools import accumulate
from operator import add
N = int(input())
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
A1 = list(accumulate(A1,add))
A2 = list(accumulate(A2,add))
S = A2[-1]
A3 = [0] * N
A3[0] = S
ans = 0
for i in range(1,N):
A3[i] = S - A2[i - 1]
ans = max([i + j for ... | 129 |
Project_CodeNet | 2,018 | N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
x = sum(A2) + A1[0]
ans = x
for i in range(N-1):
x += A1[i+1] - A2[i]
ans = max(ans, x)
print(ans)
| 76 |
Project_CodeNet | 2,018 | N = int(input())
L1 = [x for x in map(int, input().split())]
L2 = [x for x in map(int, input().split())]
P1 = L1[:]
P2 = L2[:]
for i in range(1, N):
P1[i] += P1[i-1]
for j in range(N-2, -1, -1):
P2[j] += P2[j+1]
L3 = [0]*N
for k in range(N):
L3[k] = P1[k]+P2[k]
print(max(L3)) | 129 |
Project_CodeNet | 2,018 | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s = sum(b)
mx = a[0] + s
cur = mx
for i in range(1, n):
cur += a[i] - b[i - 1]
mx = max(mx, cur)
print(mx) | 76 |
Project_CodeNet | 2,019 | # -*- coding: utf-8 -*-
#ARC082C
import copy
import sys
import math
n = int(input())
tmp = input().split()
hoge1 = list(map(lambda a: int(a), tmp))
tmp = input().split()
hoge2 = list(map(lambda a: int(a), tmp))
#print(hoge1)
#print(hoge2)
total=0
for i in range(0,n):
total+=hoge1[i]
hoge1[i]=total
total=0
for i ... | 177 |
Project_CodeNet | 2,018 | # -*- coding: utf-8 -*-
N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
for i in range(1,N):
A1[i] = A1[i] + A1[i-1]
ans = A2.copy()
ans[0] += A1[0]
for i in range(1,N):
ans[i] = max(A1[i]+A2[i], ans[i-1]+A2[i])
print(ans[N-1]) | 113 |
Project_CodeNet | 2,018 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF()... | 255 |
Project_CodeNet | 2,020 | N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
ans = 0
tmp1 = 0
for i in range(N):
tmp1 = sum(A1[:(i+1)])
tmp2 = sum(A2[i:N])
ans = max(ans, tmp1+tmp2)
print(ans) | 84 |
Project_CodeNet | 2,018 | def solve(N, A):
rmax = 0
for i in range(N):
r = sum(A[0][0:i + 1]) + sum(A[1][i:])
rmax = max(rmax, r)
return rmax
N = int(input())
A = [[int(x) for x in input().split()] for i in range(2)]
print(solve(N, A))
| 89 |
Project_CodeNet | 2,018 | N = input()
A = list(map(int, input().split()))
B = list(map(int, input().split()))
print(max([(sum(A[:i+1] + B[i:])) for i in range(len(A) + 1)])) | 51 |
Project_CodeNet | 2,018 | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
for i in range(n):
temp=sum(a[:i+1])+sum(b[i:])
ans=max(ans,temp)
print(ans)
| 52 |
Project_CodeNet | 2,019 | N=int(input())
A1 = [int(i) for i in input().split()]
A2 = [int(i) for i in input().split()]
cumA1 = [0]
cumA2 = [0]
asum = 0
bsum = 0
for a,b in zip(A1,A2):
asum += a
bsum += b
cumA1.append(asum)
cumA2.append(bsum)
print(cumA2[N]+max([cumA1[i]-cumA2[i-1] for i in range(1,N+1)])) | 128 |
Project_CodeNet | 2,018 | N = int(input())
A = []
A.append(list(map(int, input().split())))
A.append(list(map(int, input().split())))
print(max([sum(A[0][:i+1]) + sum(A[1][i:]) for i in range(N)])) | 55 |
Project_CodeNet | 2,018 | n = int(input())
a = []
for i in range(2):
a.append(list(map(int, input().split())))
def solve():
top = a[0][0]
bottom = sum(a[1])
mx = 0
for i in range(n):
top = sum(a[0][0:i+1])
bottom = sum(a[1][i:n])
mx = max(top+bottom, mx)
print(mx)
solve() | 101 |
Project_CodeNet | 2,018 | n = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
# 0,0 →1,N-1
# 1行目のi+1 ～ N-1と、 2行目のi～N-2の合計を比較。
# 2行目の方が大きくなったら下に移動する。
maxcnt = 0
if n == 1:
maxcnt=A1[0]+A2[0]
else:
for j in range(n-1):
cnt1a = sum(A1[:j+1])
#cnt2a = sum(A2[0:j])
#cnt1b =... | 229 |
Project_CodeNet | 2,018 | import sys,collections;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()
n = I()
A1 = Is()
A2 = Is()
ans = 0
for i in range(1,n+1):
ans = max(ans,sum(A1[:i]+A2[... | 108 |
Project_CodeNet | 2,020 | N = int(input())
arr_1 = []
arr_2 = []
arr_1 = list(map(int, input().split()))
arr_2 = list(map(int, input().split()))
ans = arr_1[0]+sum(arr_2)
for i in range(1,N):
ans = max(ans, sum(arr_1[:i+1])+sum(arr_2)-sum(arr_2[:i]))
print(ans) | 90 |
Project_CodeNet | 2,018 | N = input()
A1 = map(int, raw_input().split())
A2 = map(int, raw_input().split())
s = sum(A2) + A1[0]
ans = s
for i in range(N-1):
s = s + A1[i+1] - A2[i]
ans = max(s, ans)
print ans | 76 |
Project_CodeNet | 2,018 | N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
ans = 0
for i in range(N):
temp = sum(A1[:i+1]) + sum(A2[i:])
ans = max(ans, temp)
print(ans) | 64 |
Project_CodeNet | 2,018 | n = int(input())
arr = [[0]*n,[0]*n]
arr[0] = list(map(int,input().split()))
arr[1] = list(map(int,input().split()))
s = 0
for i in range(n):
s = max(s,sum(arr[0][:i+1]) + sum(arr[1][i:]))
print(s) | 77 |
Project_CodeNet | 2,018 | N = int(input())
A = []
for _ in range(2):
A.append(list(map(int, input().split())))
def dfs(i, j):
if i == 1 and j == N - 1:
return A[i][j]
if i == 1:
return dfs(i, j + 1) + A[i][j]
if j == N - 1:
return dfs(i + 1, j) + A[i][j]
else:
a1 = dfs(i + 1, j)
a2 =... | 160 |
Project_CodeNet | 2,020 | n = int(input())
grid = [list(map(int, input().split())), list(map(int, input().split()))]
dist = [[0 for _ in range(n)] for _ in range(2)]
dist[0][0] = grid[0][0]
for i in range(2):
for j in range(n):
if j < n - 1:
dist[i][j + 1] = max(dist[i][j + 1], dist[i][j] + grid[i][j + 1])
if i == 0:
dist[... | 153 |
Project_CodeNet | 2,018 | # -*- coding: utf-8 -*-
from collections import Counter
import numpy as np
import sys
n = int(input())
a1 = list(map(int,input().split()))
a2 = list(map(int,input().split()))
b1 = [0 for i in range(n)]
b2 = [0 for i in range(n)]
b1[0] = a1[0]
b2[n-1] = a2[n-1]
for i in range(1,n):
b1[i] = b1[i-1] + a1[i]
... | 168 |
Project_CodeNet | 2,018 | n = int(input())
first_row = [int(x) for x in input().split()]
sec_row = [int(x) for x in input().split()]
first_row_d = [0 for i in range(n)]
sec_row_d = [0 for i in range(n)]
first_row_d[0] = first_row[0]
for i in range(1, n):
first_row_d[i] = first_row_d[i - 1] + first_row[i]
sec_row_d[0] = first_row_d[0] + sec... | 165 |
Project_CodeNet | 2,018 | def main():
N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
ans = 0
for i in range(N):
tmp = sum(A1[:(i + 1)]) + sum(A2[i:])
if tmp > ans:
ans = tmp
print(ans)
if __name__ == '__main__':
main()
| 91 |
Project_CodeNet | 2,018 | n=int(input())
a1=[int(i) for i in input().split()]
a2=[int(i) for i in input().split()]
ma=0
for i in range(n):
m0=sum(a1[:i+1])+sum(a2[i:])
ma=max(ma,m0)
print(ma) | 68 |
Project_CodeNet | 2,020 | N = int(input())
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
ans = 0
for i in range(N):
ans = max(ans, sum(A1[:i+1]) + sum(A2[i:]))
print(ans) | 60 |
Project_CodeNet | 2,019 | N = int(input())
candies = [list(map(int, input().split())) for _ in range(2)]
dp = [[0] * (N) for _ in range(2)]
dp[0][0] = candies[0][0]
dp[1][0] = dp[0][0] + candies[1][0]
for i in range(1, N):
dp[0][i] = dp[0][i-1] + candies[0][i]
dp[1][i] = max(dp[0][i], dp[1][i-1]) + candies[1][i]
print(dp[1][N-1])
| 145 |
Project_CodeNet | 2,018 | N = int(input())
row1str = input().split()
row2str = input().split()
row1, row2 = [], []
for (s, t) in zip(row1str, row2str):
row1.append(int(s))
row2.append(int(t))
candidates = []
candidate = 0
for j in range(N):
for k in range(N):
if j>=k:
candidate += row1[k]
if j<=k:
... | 122 |
Project_CodeNet | 2,018 | n = int(input())
a = [list(map(int, input().split()))]
a.append(list(map(int, input().split())))
A = [[0 for _ in range(n)] for _ in range(2)]
A[0][0] = a[0][0]
A[1][-1] = a[1][-1]
for i in range(1, n):
A[0][i] = A[0][i - 1] + a[0][i]
A[1][-(i + 1)] = A[1][-i] + a[1][-(i + 1)]
ans = - float('inf')
for i in r... | 168 |
Project_CodeNet | 2,019 | n = int(input())
a1 = [int(x) for x in input().split()]
a2 = [int(x) for x in input().split()]
ans = [sum(a1[:i+1]) + sum(a2[i:]) for i in range(n)]
print(max(ans))
| 60 |
Project_CodeNet | 2,019 | a = int(input())
b = list(map(int, input().split()))
c = list(map(int, input().split()))
bb = [0] * a
cc = [0] * a
for i in range(a):
if i == 0:
bb[i] = b[i]
cc[-i-1] = c[-i-1]
else:
bb[i] = b[i] + bb[i-1]
cc[-i-1] = c[-i-1] + cc[-i]
ans = 0
for i in range(a):
ans = max(ans, ... | 139 |
Project_CodeNet | 2,018 | import numpy as np
N = int(input())
lst = []
for j in range(2):
lst.append([int(i) for i in input().split()])
arr = np.array(lst)
col1 = arr[0,0]
col2 = np.sum(arr[1,:])
max_v = col1 + col2
for i in range(N-1):
col1 += arr[0, i+1]
col2 -= arr[1, i]
if (max_v < col1 + col2):
max_v = col1 + col... | 125 |
Project_CodeNet | 2,018 | import math
import itertools
import heapq
from sys import stdin, stdout, setrecursionlimit
from bisect import bisect, bisect_left, bisect_right
from collections import defaultdict, deque
# d = defaultdict(lambda: 0)
# setrecursionlimit(10**7)
# inf = float("inf")
##### stdin ####
def LM(t, r): return list(map(t, r)... | 290 |
Project_CodeNet | 2,018 | N = int(input())
A = []
for _ in range(2):
A.append(list(map(int,input().split())))
dp = [[0]*N for _ in range(2)]
dp[0][0] = A[0][0]
dp[1][0] = dp[0][0] + A[1][0]
for i in range(1,N):
dp[0][i] = dp[0][i-1] + A[0][i]
for i in range(1,N):
dp[1][i] = A[1][i] + max(dp[0][i],dp[1][i-1])
print(dp[1][N-1])
| 149 |
Project_CodeNet | 2,018 | N = int(input())
upper = list(map(int, input().split()))
lower = list(map(int, input().split()))
rec = 0
ans = 0
for i in range(N):
rec = sum(upper[0:i+1]) + sum(lower[i:N+1])
ans = max(rec, ans)
print(ans)
| 72 |
Project_CodeNet | 2,018 | #
N = int(input())
A = []
A.append(list(map(int, input().rstrip().split())))
A.append(list(map(int, input().rstrip().split())))
#
ans = 0
for i in range(N):
tmp = sum(A[0][:i+1]) + sum(A[1][i:])
ans = max(ans, tmp)
#
print(ans)
| 78 |
Project_CodeNet | 2,018 | N = int(input())
A = [0] + list(map(int, input().split()))
B = [0] + list(map(int, input().split()))
imosA = [0]*(N+1)
imosB = [0]*(N+1)
for i in range(1, N+1):
imosA[i] = A[i] + imosA[i-1]
imosB[i] = B[i] + imosB[i-1]
ans = 0
for i in range(1, N+1):
ans = max(ans, imosA[i] + imosB[N] - imosB[i-1])
prin... | 144 |
Project_CodeNet | 2,019 | N=int(input())
A=list()
for i in range(2):
A.append(list(map(int,input().split())))
dp = [[0 for i in range(N + 1)] for j in range(2)]
dp[0][0]=A[0][0]
dp[1][0]=A[0][0]+A[1][0]
for j in range(N-1):
dp[0][j+1]=dp[0][j]+A[0][j+1]
for j in range(N-1):
dp[1][j+1]=max(dp[0][j+1]+A[1][j+1],dp[1][j]+A[1][j... | 164 |
Project_CodeNet | 2,018 | n = int(input())
a1 = list(map(int,input().split()))
a2 = list(map(int,input().split()))
ans = 0
for i in range(n):
ans = max(sum(a1[:n-i])+sum(a2[-i-1:]),ans)
print(ans) | 61 |
Project_CodeNet | 2,020 | n = int(input())
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
for i in range(1,n):
A[i] += A[i-1]
for i in range(n-2,-1,-1):
B[i] += B[i+1]
print(max([A[i]+B[i] for i in range(n)])) | 85 |
Project_CodeNet | 2,018 | import math
import sys
import heapq
sys.setrecursionlimit(10**8)
N = int(input())
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
A1sum=[0]
A2sum=[0]
aa1 = aa2 = 0
for i in range(N):
aa1 += A1[i]
aa2 += A2[i]
A1sum.append(aa1)
A2sum.append(aa2)
ans = 0
for i in range(1,N+1):
ue = A1sum... | 152 |
Project_CodeNet | 2,019 | a = int(input())
ar = list(map(int,input().split(" ")))
br = list(map(int,input().split(" ")))
cr = []
for i in range(1,a+1):
count = sum(ar[0:i]) + sum(br[i-1:a])
cr.append(count)
print(max(cr)) | 66 |
Project_CodeNet | 2,018 | N = int(input())
A_upper = list(map(int, input().split()))
A_lower = list(map(int, input().split()))
max_A_sum = 0
for i in range(N):
A_sum = sum(A_upper[:i+1]) + sum(A_lower[i:])
if A_sum > max_A_sum:
max_A_sum = A_sum
print(max_A_sum)
| 80 |
Project_CodeNet | 2,018 | N = int(input())
A = [[] for i in range(2)]
for i in range(2):
a = list(map(int, input().split()))
A[i] = a
num = 0
for i in range(N):
num = max(num, sum(A[0][:i + 1]) + sum(A[1][i:]))
print(num) | 79 |
Project_CodeNet | 2,018 | n = int(input())
aa = list(map(int, input().split()))
bb = list(map(int, input().split()))
s = aa[0] + sum(bb)
best = s
for i in range(1, n):
s += aa[i] - bb[i - 1]
if s > best:
best = s
print(best)
| 75 |
Project_CodeNet | 2,020 | N = int(input())
A = [list(map(int, input().split())) for i in range(2)]
def dfs(i, j, candy):
if(i > 1 or j >= N):
return 0
if(i == 1 and j == N - 1):
return candy + A[1][N - 1]
candy += A[i][j]
return max(dfs(i + 1, j, candy), dfs(i, j + 1, candy))
print(dfs(0, 0, 0))
| 118 |
Project_CodeNet | 2,018 | n = int(raw_input())
c0 = map(int, raw_input().split())
c1 = map(int, raw_input().split())
ame = []
for i in xrange(n):
ame.append(sum(c0[:i+1]+c1[i:]))
print max(ame) | 59 |
Project_CodeNet | 2,018 | N = int(input())
A = []
A.append(list(map(int, input().split())))
A.append(list(map(int, input().split())))
Smax = 0
for i in range(N):
Sl = sum(A[0][0:i + 1])
Sr = sum(A[1][i:])
tmp = Sl + Sr
if Smax < tmp:
Smax = tmp
print(Smax) | 88 |
Project_CodeNet | 2,019 | N=int(input())
x=list(map(int,input().split()))
y=list(map(int,input().split()))
a=[0]*(N)
for i in range(N):
for k in range(i+1):
a[i]+=x[k]
for j in range(N-i):
a[i]+=y[j+i]
print(max(a)) | 68 |
Project_CodeNet | 2,018 | n = int(input())
a = list(map(int, input().split(" ")))
b = list(map(int, input().split(" ")))
m = 0
for i in range(n):
m = max(m, sum(a[0:i+1]) + sum(b[i:]))
print(m)
| 63 |
Project_CodeNet | 2,018 | N=int(input())
A1=[int(i) for i in input().split(" ")]
A2=[int(i) for i in input().split(" ")]
total=sum(A2)+A1[0]
maximum=total
for i in range(N-1):
total+=A1[i+1]
total-=A2[i]
maximum=max(maximum,total)
print(maximum)
| 83 |
Project_CodeNet | 2,020 | n=int(input())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
ans=0
for i in range(n):
ans=max(ans,sum(a[:i+1]+b[i:]))
print(ans)
| 56 |
Project_CodeNet | 2,018 | def LI(): return list(map(int, input().split()))
def LS(): return input().split()
def I(): return int(input())
def S(): return input()
n = I()
a1 = LI()
a2 = LI()
s1 = []
s2 = []
ans = 0
now = 0
now2 = 0
for i in range(n):
now += a1[i]
s1.append(now)
now2 += a2[-i-1]
s2.append(now2)
s2 = s2[::-1]
for ... | 140 |
Project_CodeNet | 2,018 | #1st arg is the how far from the most upper side
#2nd arg is the how far from the most left side
#right means +1 in terms of x-axis
#upper means -1 in terms of y-axis
def Right(position):
position[1] += 1
def Down(position):
position[0] += 1
def Collect(position,candy):
x = position[0]
y = position[1]
total = ... | 260 |
Project_CodeNet | 2,018 | import numpy as np
N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
reward = []
for i in range(N):
r = np.sum(A1[:i+1]) + np.sum(A2[i:])
reward.append(r)
print(np.max(reward)) | 73 |
Project_CodeNet | 2,018 | ans = []
N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
for i in range(0, N):
ans.append(sum(A1[0:i+1]) + sum(A2[i:N]))
print(max(ans))
| 62 |
Project_CodeNet | 2,019 | n=int(input())
a1=list(map(int,input().split()))
a2=list(map(int,input().split()))
for i in range(1,n):
a1[i]=a1[i]+a1[i-1]
a2[n-1-i]=a2[n-1-i]+a2[n-i]
ans=0
for i in range(n):
ans=max(ans,a1[i]+a2[i])
print(ans) | 90 |
Project_CodeNet | 2,018 | N=int(raw_input())
A1=map(int, raw_input().split())
A2=map(int, raw_input().split())
ans=0
for i in range(N):
ans=max(ans, sum(A1[:i]+A2[i:])+A1[i])
print ans
| 60 |
Project_CodeNet | 2,020 | n = int(input())
a = [0,0]
a[0] = list(map(int,input().split()))
a[1] = list(map(int,input().split()))
ans = 0
ruiseki_upper = [0]
ruiseki_downer = [0]
for i in range(n):
ruiseki_upper.append(a[0][i] + ruiseki_upper[i])
ruiseki_downer.append(a[1][i] + ruiseki_downer[i])
for i in range(n+1):
candy = ruiseki_... | 147 |
Project_CodeNet | 2,018 | N=int(input().strip())
maze=[]
for _ in range(2):
maze.append(list(map(int, input().split())))
ans=0
for i in range(N):
ans=max(ans,sum(maze[0][:i+1])+sum(maze[1][i:]))
print(ans) | 62 |
Project_CodeNet | 2,018 | n = int(input())
ups = [int(c) for c in input().split()]
downs = [int(c) for c in input().split()]
ans = 0
for x in range(0, n):
ans = max(ans, sum(ups[0:x+1]) + sum(downs[x:n]))
print(ans) | 71 |
Project_CodeNet | 2,018 | n = int(input())
a1 = input().split()
a2 = input().split()
a1 = [int(x) for x in a1]
a2 = [int(x) for x in a2]
ans = 0
for i in range(n):
ans = max(ans, sum(a1[0:i+1]) + sum(a2[i:n]))
print(ans) | 81 |
Project_CodeNet | 2,018 | from sys import exit, setrecursionlimit
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect
def read():
return int(input())
def reads():
return [int(x) for x in input().split()]
setrecursionlimit(1000000)
N = read()
A = []
for _ in range(2):
A.ap... | 113 |
Project_CodeNet | 2,019 | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
tl = [0] * n
at = 0
bt = 0
for i in range(n):
at += a[i]
bt += b[-i-1]
tl[i] += at
tl[-i-1] += bt
print(max(tl))
| 86 |
Project_CodeNet | 2,018 | #!/usr/bin/env python3
H = 2
def solve(n, board):
max_res = 0
for down_step in range(n):
is_down = [False for _ in range(n)]
is_down[down_step] = True
r, c = 0, 0
res = board[r][c]
for step in is_down:
if step:
r += 1
else:
... | 190 |
Project_CodeNet | 2,018 | import numpy as np
N=int(input())
a=[[],[]]
a[0]=list(map(int,input().split()))
a[1]=list(map(int,input().split()))
s=np.array(a)
s[1]=np.cumsum(s[1][::-1])[::-1]
s[0][-1]+=s[1][-1]
for i in range(N-2,-1,-1):
s[0][i]+=max(s[1][i],s[0][i+1])
print(s[0][0]) | 111 |
Project_CodeNet | 2,020 | n=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
def rui(A):
R=[A[0]]*len(A)
for i in range(len(A)-1):
R[i+1]=R[i]+A[i+1]
return R
R=rui(A)
RR=rui(B)
ans=0
for i in range(n):
tt=RR[i-1] if i!=0 else 0
ans=max(ans,R[i]+ RR[-1]-tt)
print(ans) | 116 |
Project_CodeNet | 2,018 | N = int(input())
A = []
A.append(list(map(int,input().split())))
A.append(list(map(int,input().split())))
S1 = [sum(A[0][:j+1]) for j in range(N)]
S2 = [sum(A[1][j:]) for j in range(N)]
print(max([S1[i]+S2[i] for i in range(N)])) | 81 |
Project_CodeNet | 2,018 | #!/usr/bin/env python3
n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
assert len(a1) == len(a2) == n
def down_at_i(i0):
res = 0
for k in range(i0 + 1):
res += a1[k]
for k in range(i0, n):
res += a2[k]
return res
res = 0
for i in range(n):
... | 125 |
Project_CodeNet | 2,018 | N = int(input())
A1 = list(map(int, input().split(' ')))
A2 = list(map(int, input().split(' ')))
now_gain = sum(A2) + A1[0]
max_gain = now_gain
for i in range(1, N):
now_gain = now_gain - A2[i-1] + A1[i]
max_gain = max(max_gain, now_gain)
print(max_gain)
| 92 |
Project_CodeNet | 2,019 | # coding: utf-8
II = lambda: int(input())
MI = lambda: map(int, input().split())
MIL = lambda: list(MI())
MIS = lambda: input().split()
def main():
N = II()
A = [MIL(), MIL()]
ans = 0
for i in range(N):
ta = sum(A[0][:i + 1]) + sum(A[1][i:])
ans = max(ans, ta)
return ans
if __n... | 118 |
Project_CodeNet | 2,020 | n=int(input())
a=[]
for i in range(2):
a.append(list(map(int,input().split())))
ans=0
for i in range(n):
tmp=0
tmp+=sum(a[0][0:i+1])
tmp+=sum(a[1][i:])
ans=max(ans,tmp)
print(ans) | 70 |
Project_CodeNet | 2,018 | n = int(input())
u = [int(x) for x in input().split()]
d = [int(x) for x in input().split()]
s = u[0]+sum(d)
m = s
for i in range(n-1):
s = s-d[i]+u[i+1]
if m < s:
m = s
print(m)
| 78 |
Project_CodeNet | 2,019 | #!/usr/bin/env python3
import sys
def solve(N: int, A):
d = [[0] * N for i in range(2)]
d[1][N-1] = A[1][N-1]
d[0][N-1] = A[0][N-1] + d[1][N-1]
for i in range(2, N+1):
d[1][N-i] = d[1][N-i+1] + A[1][N-i]
d[0][N-i] = A[0][N-i] + max(d[1][N-i], d[0][N-i+1])
print(d[0][0])
def main(... | 241 |
Project_CodeNet | 2,018 | def main():
N = int(input())
a1 = list(map(int,input().split(" ")))
a2 = list(map(int,input().split(" ")))
temp = 0
for i in range(N):
s = sum(a1[0:i+1])+sum(a2[i:])
if temp<s:
temp = s
print(temp)
if __name__=="__main__":
main() | 90 |
Project_CodeNet | 2,019 | n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
ans = 0
for i in range(n):
ans = max(ans, sum(a1[:i + 1]) + sum(a2[i:]))
print(ans) | 63 |
Project_CodeNet | 2,020 | N = int(input())
a_list = []
a_list.append(list(map(int,input().split(" "))))
a_list.append(list(map(int,input().split(" "))))
dp = [[0]*(N+1)]*2
for i in range(2):
for j in range(1,N+1):
if i == 0:
dp[i][j] = dp[i][j-1] + a_list[i][j-1]
else:
dp[i][j] = max(dp[i-1][j],dp[i... | 134 |
Project_CodeNet | 2,020 | n=int(input())
a1=[int(x) for x in input().split()]
a2=[int(x) for x in input().split()]
ans=[0 for i in range(n)]
c1=0
c2=0
for i in range(n):
c1+=a1[i]
c2+=a2[-1-i]
ans[i]+=c1
ans[-1-i]+=c2
print(max(ans)) | 93 |
Project_CodeNet | 2,018 | n = int(input())
a = []
for i in range(2):
a.append(list(map(int, input().split())))
ans = []
for i in range(n):
ans.append(sum(a[0][:(i+1)]) + sum(a[1][i:]))
print(max(ans)) | 61 |
Project_CodeNet | 2,018 | N = int(input())
A0 = list(map(int, input().split()))
A1 = list(map(int, input().split()))
A_max = 0
for n in range(0, N):
A_sum = sum(A0[0:n+1]) + sum(A1[n:])
if A_sum > A_max:
A_max = A_sum
print(A_max)
| 80 |
Project_CodeNet | 2,018 | N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
if N == 1:
print(sum(A1) + sum(A2))
else:
B1 = [0 for i in range(N)]
B2 = [0 for i in range(N)]
B1[0] = A1[0]
for i in range(1, N):
B1[i] = B1[i - 1] + A1[i]
B2[0] = B1[0] + A2[0]
for i in range(1, N):
B2[i] = max(... | 162 |
Project_CodeNet | 2,020 | def main():
N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
m = 0
for i in range(N):
temp = 0
for j in range(i+1):
temp += A1[j]
for j in range(i,N):
temp += A2[j]
if temp > m:
m = temp... | 112 |
Project_CodeNet | 2,018 | n = int(input())
a = [list(map(int, input().split())) for _ in range(2)]
ans = 0
s = [[0], [0]]
for i in range(2):
for j in range(n):
s[i].append(s[i][-1] + a[i][j])
for i in range(n):
ans = max(ans, s[0][i + 1] + s[1][-1] - s[1][i])
print(ans) | 104 |
Project_CodeNet | 2,018 | from sys import stdin
in_n = int(stdin.readline())
in_a = []
in_a.append([ int(e) for e in stdin.readline().split(' ')])
in_a.append([ int(e) for e in stdin.readline().split(' ')])
out_a = [
[ -1 for _ in range(in_n) ] + [0],
[ -1 for _ in range(in_n) ] + [0]
]
for j in reversed(range(in_n)):
for i in reversed... | 177 |
Project_CodeNet | 2,019 | from sys import stdin
N = int(stdin.readline().rstrip())
A = [[int(x) for x in stdin.readline().rstrip().split()] for _ in range(2)]
dp = [[0] * N for _ in range(2)]
for n in range(N):
dp[0][n] = sum(A[0][:n + 1])
dp[1][0] = A[0][0] + A[1][0]
for n in range(1, N):
dp[1][n] = max(dp[0][n], dp[1][n - 1]) + A[1][... | 144 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.