Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | N = int(input())
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
A2.reverse()
C1 = [A1[0]]
for i in range(1, N):
C1.append(C1[i-1]+A1[i])
C2 = [A2[0]]
for i in range(1, N):
C2.append(C2[i-1]+A2[i])
C1.reverse()
ans = C1[0] + C2[0]
for i in range(1, N):
ans = max(ans, C1[i]+C2[i])
... | 136 |
Project_CodeNet | 2,020 | from itertools import accumulate
N = int(input())
A = list(map(int, input().split()))
S = [0]+list(accumulate(A))
B = list(map(int, input().split()))
T = [0]+list(accumulate(B))
res = 0
for i in range(N):
res = max(S[i+1] + T[N]-T[i], res)
print(res) | 82 |
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(sum(A1[:i + 1]) + sum(A2[i:]),ans)
print(ans) | 61 |
Project_CodeNet | 2,018 | N=int(input())
array=[]
array.append([int(i) for i in input().split()])
array.append([int(i) for i in input().split()])
MAX=0
for i in range(N):
tmp=0
for j in range(i+1):
tmp+=array[0][j]
for j in range(i, N):
tmp+=array[1][j]
if MAX < tmp:
MAX=tmp
print(MAX) | 97 |
Project_CodeNet | 2,018 | n = int(input())
a = [None] * 2
a[0] = list(map(int, input().split()))
a[1] = list(map(int, input().split()))
dp = [[0] * n for i in range(2)]
dp[0][0] = a[0][0]
for i in range(n):
if i == 0:
dp[1][i] = dp[0][i] + a[1][i]
else:
dp[0][i] = dp[0][i - 1] + a[0][i]
dp[1][i] = max(dp[0][i],... | 169 |
Project_CodeNet | 2,018 | # C
N = int(input())
A1_list = list(map(int, input().split()))
A2_list = list(map(int, input().split()))
s = 0
for i in range(N):
t = s
s += A1_list[i]
A1_list[i] += t
s = 0
for i in range(N-1, -1, -1):
t = s
s += A2_list[i]
A2_list[i] += t
print(max([A1_list[i] + A2_list[i] for i in ... | 127 |
Project_CodeNet | 2,018 | import numpy as np
n = int(input())
u = np.array(list(map(int, input().split())))
b = np.array(list(map(int, input().split())))
ma = 0
for i in range(n):
ma = max(np.sum(u[:i+1]) + np.sum(b[i:]), ma)
print(ma) | 70 |
Project_CodeNet | 2,020 | n = int(input())
lst1 = list(map(int,input().split()))
lst2 = list(map(int,input().split()))
ans = 0
for i in range(n):
ans = max(ans,sum(lst1[:i+1]) + sum(lst2[i:]))
print(ans) | 59 |
Project_CodeNet | 2,020 | N, = map(int, input().split())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
ss = 0
rr = 0
for i in range(N):
ss += a1[i]
tt = 0
for j in range(i, N):
tt += a2[j]
rr = max(ss+tt, rr)
print(rr)
| 90 |
Project_CodeNet | 2,018 | N = input()
A = [None]*2
A[0] = map(int, raw_input().split())
A[1] = map(int, raw_input().split())
T = [[0]*2 for _ in range(N)]
T[0][0] = A[0][0]
T[0][1] = A[1][0]+A[0][0]
for i in range(1,N):
T[i][0] = T[i-1][0]+A[0][i]
T[i][1] = max(T[i-1][1],T[i-1][0]+A[0][i])+A[1][i]
print T[N-1][1]
| 151 |
Project_CodeNet | 2,019 | N = int(input())
A =[[] for j in range(2)]
for i in range(2):
A[i] = list(map(int, input().split()))
cum_sum = [[0 for i in range(N)] for j in range(2)]
cum_sum[0][0] = A[0][0]
cum_sum[1][N - 1] = A[1][N - 1]
for i in range(1, N):
cum_sum[0][i] = cum_sum[0][i - 1] + A[0][i]
for i in range(N - 2, -1, -1):
... | 200 |
Project_CodeNet | 2,019 | N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
AS=[A[0]]
for i in range(1,N):
AS.append(AS[i-1]+A[i])
dp=[0 for i in range(N)]
dp[0]=A[0]+B[0]
for i in range(1,N):
dp[i]=max(AS[i]+B[i],dp[i-1]+B[i])
print(dp[N-1]) | 101 |
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(0,N):
asum=0
bsum=0
for j in range(i+1):
asum+=A[j]
for j in range(i,N):
bsum+=B[j]
ans=max(ans,asum+bsum)
print(ans)
| 88 |
Project_CodeNet | 2,018 | import sys
N = int(input())
A = [list(map(int, input().split())) for _ in range(2)]
dp = [[0 for _ in range(N)]for _ in range(2)]
dp[0][0] = A[0][0]
for i in range(2):
for j in range(N):
if j < N-1:
dp[i][j + 1] = max(dp[i][j + 1], dp[i][j] + A[i][j + 1])
if i == 0:
dp[1]... | 155 |
Project_CodeNet | 2,020 | n=int(input())
a1=list(map(int,input().split()))
a2=list(map(int,input().split()))
ans=0
all=sum(a1)+sum(a2)
for i in range(n):
temp=all-sum(a2[:i])-sum(a1[i+1:])
ans=max(ans,temp)
print(ans) | 66 |
Project_CodeNet | 2,019 | N = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
for i in range(N):
ans_new = sum(a[:i+1]) + sum(b[i:])
ans = max(ans, ans_new)
print(ans)
| 64 |
Project_CodeNet | 2,019 | import sys
input = sys.stdin.readline
def main():
N = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
left = [a[0]] * N
right = [b[-1]] * N
for i in range(1, N):
left[i] = left[i-1] + a[i]
for i in range(N-2, -1, -1):
right[i] = right[i... | 155 |
Project_CodeNet | 2,018 | N = int(input())
src = [list(map(int,input().split())) for i in range(2)]
ans = 0
for i in range(N):
tmp = sum(src[0][:i+1]) + sum(src[1][i:])
ans = max(tmp,ans)
print(ans)
| 64 |
Project_CodeNet | 2,019 | N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
count1 = [A1[0]] * N
count2 = [A2[-1]] * N
for i in range(1, N):
count1[i] = count1[i-1] + A1[i]
count2[N-1-i] = count2[N-i] + A2[N-1-i]
candy = 0
for i in range(0, N):
candy = max(candy, count1[i] + count2[i])
pri... | 134 |
Project_CodeNet | 2,020 | N = int(input())
A = [list(map(int, input().split())) for _ in range(2)]
v1 = A[0][0]
v2 = A[1][0] + v1
if N==1:
print(v2)
exit()
for j in range(1, N):
v1 += A[0][j]
v2 = A[1][j] + max(v2, v1)
print(v2) | 99 |
Project_CodeNet | 2,020 | maxa=10**10*(-1)
N=int(input())
list1=list(map(int,input().split()))
list2=list(map(int,input().split()))
for i in range(1,N+1):
maxa=max(sum(list1[:i])+sum(list2[i-1:]),maxa)
print(maxa) | 66 |
Project_CodeNet | 2,018 | N = int(input())
List = [list(map(int, input().split())) for i in range(2)]
ans = 0
for i in range(N):
temp = sum(List[0][0:i+1]) + sum(List[1][i:])
if temp > ans:
ans = temp
print(ans)
| 69 |
Project_CodeNet | 2,019 | n = int(input())
a = [list(map(int, input().split()))]
a.append(list(map(int, input().split())))
dp = [[0] * n, [0] * n]
dp[0][0] = a[0][0]
dp[1][0] = a[0][0] + a[1][0]
for i in range(1, n):
dp[0][i] = dp[0][i - 1] + a[0][i]
dp[1][i] = max(dp[1][i - 1], dp[0][i]) + a[1][i]
print(dp[1][-1]) | 145 |
Project_CodeNet | 2,018 | n = int(input())
a0 = list(map(int, input().strip().split()))
a1 = list(map(int, input().strip().split()))
for i in range(1,n):
a0[i] += a0[i-1]
a1[n-1-i] += a1[n-i]
print(max(a0[i]+a1[i] for i in range(n))) | 81 |
Project_CodeNet | 2,018 | ans=[]
n=int(input())
A1=list(map(int,input().split()))
A2=list(map(int, input().split()))
for i in range(n):
ans.append(sum(A1[0:i+1])+sum(A2[i:n]))
print(max(ans))
#d,eには同じ入力が入っている
#sum2row=sum(e)
#uc=it.accumulate(u)
#ucは1行目の累計和のリスト
#print(uc) | 101 |
Project_CodeNet | 2,018 | f = lambda: map(int,input().split())
n = int(input())
a1 = list(f())
a2 = list(f())
ans = sum(a1)+a2[-1]
for i in range(1,n):
b = a1[:i]+a2[i-1:]
ans = max(ans,sum(b))
print(ans) | 71 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
class Scanner():
def int():
return int(sys.stdin.readline().rstrip())
... | 522 |
Project_CodeNet | 2,019 | n = int(input())
block = [list(map(lambda x: int(x), input().split())) for _ in range(2)]
dp = [[0] * n] * 2
for row in range(2):
for column in range(n):
numbers = []
if column != 0:
numbers.append(dp[row][column - 1])
if row != 0:
numbers.append(dp[row - 1][column])
if len(numbers) > 0:
... | 144 |
Project_CodeNet | 2,019 | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
Candies=[]
for i in range(n):
Candies.append(sum(a[:i+1])+sum(b[i:]))
print(max(Candies)) | 52 |
Project_CodeNet | 2,018 | N = int(input())
Au = list(map(int, input().split()))
Al = list(map(int, input().split()))
cAu = [0]
cAl = [0]
for i in range(1, N + 1):
cAu.append(cAu[-1] + Au[i - 1])
cAl.append(cAl[-1] + Al[N - i])
maxv = -1
maxi = -1
for i in range(1, N + 1):
v = cAu[i] + cAl[N - i + 1]
if maxv < v:
maxi =... | 143 |
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):
ame = sum(a1[:i+1]) + sum(a2[i:])
ans = max(ans, ame)
print(ans) | 68 |
Project_CodeNet | 2,018 | n = int(input())
line = input().split(" ")
a = list(map(int, line))
line = input().split(" ")
b = list(map(int, line))
ans = 0
for i in range(0, len(a)):
if ans < sum(a[0:i+1]) + sum(b[i:n]):
ans = sum(a[0:i+1]) + sum(b[i:n])
print(ans)
| 88 |
Project_CodeNet | 2,020 | N = int(input())
A = []
A.append(list(map(int,input().split())))
A.append(list(map(int,input().split())))
row = 0
top_line = 0
down_line = sum(A[1][:])
ans = 0
for i in range(N):
top_line=top_line+A[0][i]
ans = max(ans,top_line+down_line)
down_line=down_line-A[1][i]
print(ans) | 94 |
Project_CodeNet | 2,020 | n=int(input())
a=[]
for i in range(2):
a.append([])
for i in range(2):
a[i]=list(map(int,input().split()))
dp=[[0]*n for i 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]=max(dp[0][i],dp[1][i-1])+a[1][i]
print(dp[1][n-1]) | 151 |
Project_CodeNet | 2,018 | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_sum = 0
B_sum = 0
for i in range(N):
A_sum += A[i]
A[i] = A_sum
B_sum += B[i]
B[i] = B_sum
ans = 0
for i in range(N):
if i == 0:
ans = A[i] + B[-1]
else:
ans = max(ans, A[i] + B[-1] - B[i ... | 129 |
Project_CodeNet | 2,018 | def solve(n, as1, as2):
for i in range(1, n):
as1[i] += as1[i - 1]
as2[n - 1 - i] += as2[n - i]
return max(a1 + a2 for (a1, a2) in zip(as1, as2))
if __name__ == "__main__":
n = int(input())
as1 = [int(s) for s in input().split()]
as2 = [int(s) for s in input().split()]
print(sol... | 130 |
Project_CodeNet | 2,020 | # arc090
n = int(input())
a = [list(map(int, input().split())) for _ in range(2)]
dp = [[-1] * n for _ in range(2)]
# 初期値
dp[0][-1] = a[0][-1] + a[1][-1]
dp[1][-1] = a[1][-1]
for k in range(n - 2, -1, -1):
dp[1][k] = a[1][k] + dp[1][k + 1]
dp[0][k] = max(dp[1][k], dp[0][k + 1]) + a[0][k]
print(dp[0][0]) | 160 |
Project_CodeNet | 2,018 | n = int(input())
a0 = [int(x) for x in input().split()]
a1 = [int(x) for x in input().split()]
ans = 0
s = sum(a1)
for i in range(n):
s += a0[i]
if i == 0:
pass
else:
s -= a1[i-1]
if s > ans:
ans = s
print(ans) | 93 |
Project_CodeNet | 2,018 | input()
a1 = list(map(int, input().split(" ")))
a2 = list(map(int, input().split(" ")))
res=[sum(a2)+a1[0]]
for x,y in zip(a1[1:],a2):
res.append(res[-1]-y+x)
print(max(res)) | 66 |
Project_CodeNet | 2,020 | N=int(input())
A1=list(map(int,input().split()))
A2=list(map(int,input().split()))
result=[]
for i in range(N):
result.append(int(sum(A1[:i+1])+sum(A2[i:])))
print(int(max(result)))
| 55 |
Project_CodeNet | 2,019 | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[]
for i in range(n):
c.append(sum(a[:i+1]+b[i:]))
print(max(c)) | 46 |
Project_CodeNet | 2,018 | N=int(input())
A_1=list(map(int, input().split()))
A_2=list(map(int, input().split()))
total_1=[0]*(N+1)
total_2=[0]*(N+1)
num_candy=[0]*N
for i in range(N):
total_1[i+1]=A_1[i]+total_1[i]
total_2[i+1]=A_2[i]+total_2[i]
for j in range(N):
num_candy[j]=total_1[j+1]+(total_2[N]-total_2[j])
print(max(num_candy))
| 129 |
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):
# 1行目のiまでと2行目のiからを加算
A_sum = sum(A_upper[:i+1]) + sum(A_lower[i:])
# print(A_sum,(A_upper[:i+1]),(A_lower[i:])
# 比較
if A_sum > max_A_sum:
max_A_sum = A_su... | 129 |
Project_CodeNet | 2,018 | # -*- coding: utf-8 -*-
from itertools import accumulate
def inpl(): return tuple(map(int, input().split()))
N = int(input())
A = inpl()
B = inpl()
res = 0
for i in range(N):
res = max(res, sum(A[:i+1]) + sum(B[i:]))
print(res) | 74 |
Project_CodeNet | 2,018 | n = int(input())
r, s = 2, n
a = []
for i in range(r):
a.append(list(map(int, input().split())))
jagoda = [[-1 for j in range(s)] for i in range(r)]
# Pocetno polje
jagoda[0][0] = a[0][0]
# Prvi redak
for j in range(1, s):
jagoda[0][j] = jagoda[0][j - 1] + a[0][j]
# Prvi stupac
for i in range(1, r):
jag... | 224 |
Project_CodeNet | 2,020 | N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
if N == 1:
print(sum(A1) + sum(A2))
exit()
ans = 0
for i in range(N+1):
ans = max(ans, sum(A1[0:i]) + sum(A2[i-1:N]))
print(ans) | 86 |
Project_CodeNet | 2,019 | N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
sumA = 0
sumB = 0
for i in range(N):
sumA += A[i]
sumB += B[i]
ruisekiA = [sumA]
ruisekiB = [sumB]
for i in range(1, N):
ruisekiA.append(ruisekiA[i-1] - A[i-1])
ruisekiB.append(ruisekiB[i-1] - B[i-1])
kouho = []
for ... | 161 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
from itertools import product, permutations, combinations
H=2
W=int(input())
candies = [list(map(int, input().split())) for i in range(H)]
count = [0 for i in range(W)]
for p in range(W):
count[p] = sum(candies[0][0:p+1]) + sum(candies[1][p:W+1])
print(max(count))
| 94 |
Project_CodeNet | 2,020 | N=int(input())
A=[list(map(int,input().split())) for _ in range(2)]
temp=0
for i in range(N):
temp=max(temp, sum(A[0][:i+1])+sum(A[1][i:]))
print(temp) | 55 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(N):
ans = max(sum(A[:i+1]) + sum(B[i:]), ans)
print(ans) | 58 |
Project_CodeNet | 2,018 | N = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
res = 0
for i in range(N):
temp = sum(a[:i+1])+sum(b[i:])
if temp > res: res = temp
print(res) | 63 |
Project_CodeNet | 2,020 | n = int(input())
l = list(map(int,input().split()))
m = list(map(int, input().split()))
ans = 0
for i in range(n):
ans = max(ans, sum(l[:n-i]) + sum(m[n - i - 1:]))
print(ans) | 61 |
Project_CodeNet | 2,019 | n = int(input())
upper = list(map(int, input().split()))
lower = list(map(int, input().split()))
ret = 0
cumsum_u = []
for i in range(len(upper)):
ret += upper[i]
cumsum_u += [ret]
ret = 0
cumsum_l = []
for i in range(len(lower)):
ret += lower[len(lower) - i - 1]
cumsum_l = [ret] + cumsum_l
an... | 134 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))
n = ini()
a = inl()
b = inl()
for i in range(1, n):
a[i] += a[i-1]
for i in ra... | 150 |
Project_CodeNet | 2,018 | N = int(input())
A1 = [int(x) for x in input().split()]
A2 = [int(x) for x in input().split()]
s = 0
for i in range(N):
_s = sum(A1[:i+1])
_s += sum(A2[i:])
s = max(_s, s)
print(s) | 77 |
Project_CodeNet | 2,020 | #!python3
# input
N = int(input())
A = [list(map(int, input().split())) for _ in range(2)]
def main():
w = []
for i in range(2):
l = [0] * (N + 1)
for j in range(N):
l[j + 1] = l[j] + A[i][j]
w.append(l)
ans = 0
for i in range(N):
x = w[0][i + 1] + (w[... | 153 |
Project_CodeNet | 2,018 | N = int(input())
A1s = list(map(int, input().split()))
A2s = list(map(int, input().split()))
ans = 0
for j in range(N):
c = sum(A1s[:j + 1]) + sum(A2s[j:])
ans = max(ans, c)
print(ans)
| 71 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.readline
N = int(input())
A0 = list(map(int, input().split()))
A1 = list(map(int, input().split()))
ans = 0
for i in range(N):
n = sum(A0[:i+1]) + sum(A1[i:N])
ans = max(ans, n)
print(ans)
| 76 |
Project_CodeNet | 2,018 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
ans = A1[0] + ... | 128 |
Project_CodeNet | 2,018 | N = int(input())
L1 = list(map(int, input().split()))
L2 = list(map(int, input().split()))
m = 0
for i in range(N):
tmp = sum(L1[0:i+1])
tmp = tmp + sum(L2[i:])
m = max(m, tmp)
print(m) | 71 |
Project_CodeNet | 2,019 | # ARC090C - Candies (ABC087C)
def main():
N = int(input())
A = tuple(tuple(map(int, input().rstrip().split())) for _ in range(2))
ans = {sum(A[0][: i + 1]) + sum(A[1][i:]) for i in range(N)}
print(max(ans))
if __name__ == "__main__":
main() | 86 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
S_A = [0]*N
S_A[0] = A[0]
for i in range(1,N):
S_A[i] = S_A[i-1] + A[i]
S_B = [0]*N
S_B[0] = B[0]
for i in range(1,N):
S_B[i] = S_B[i-1] + B[i]
ans = 0
max_sb = S_B[-1]
for i in range(N):
tmp = 0
tmp += S_A[i]
... | 181 |
Project_CodeNet | 2,018 | #!/usr/bin/env python
from collections import deque
import itertools as it
import sys
import math
sys.setrecursionlimit(1000000)
N = input()
A1 = map(int, raw_input().split())
A2 = map(int, raw_input().split())
for i in range(1, N):
A1[i] += A1[i - 1]
for i in range(0, N - 1)[::-1]:
A2[i] += A2[i + 1]
an... | 136 |
Project_CodeNet | 2,018 | k=int(input())
a=[]
a.append(list(map(int,input().split(" "))))
a.append(list(map(int,input().split(" "))))
s_max=0
for i in range(k):
s=sum(a[0][0:i+1])+sum(a[1][i:])
if(s>s_max):
s_max=s;
print(s_max) | 71 |
Project_CodeNet | 2,020 | n=int(input())
a=[list(map(int,input().split())) for _ in range(2)]
mx=0
my=0
for i in range(n):
my=sum(a[0][0:i+1]+a[1][i:])
mx=max(mx,my)
print(mx) | 62 |
Project_CodeNet | 2,018 | n=int(input())
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
aa=[0 for i in range(n)]
bb=[0 for i in range(n)]
aa[0]=a[0]
bb[n-1]=b[n-1]
for i in range(n-1):
aa[i+1]=a[i+1]+aa[i]
bb[n-2-i]=b[n-2-i]+bb[n-1-i]
ame=0
for i in range(n):
ame=max(ame, aa[i]+bb[i])
print(ame) | 133 |
Project_CodeNet | 2,018 | from collections import Counter
import math
import sys
def getinputdata():
# 配列初期化
array_result = []
data = input()
array_result.append(data.split(" "))
flg = 1
try:
while flg:
data = input()
array_temp = []
if(data != ""):
... | 215 |
Project_CodeNet | 2,018 | n = int(input())
a1 = [int(x) for x in input().split()]
a2 = [int(x) for x in input().split()]
ans = 0
for k in range(n):
tmp = 0
for i in range(n):
if (i <= k):
tmp += a1[i]
if (i >= k):
tmp += a2[i]
if tmp > ans:
ans = tmp
print(ans)
| 99 |
Project_CodeNet | 2,018 | N=int(input())
A=[[int(i) for i in input().split()]for i in range(2)]
ans = 0
for i in range(N):
t=sum(A[0][:i+1])+sum(A[1][i:])
#print(t)
ans = max(ans,t)
print(ans) | 67 |
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):
bns = sum(a1[:i+1]) + sum(a2[i:])
if ans < bns:
ans = bns
print(ans) | 70 |
Project_CodeNet | 2,018 | N = int(input())
A = []
A.append(list(map(int, input().split())))
A.append(list(map(int, input().split())))
ans = sum(A[1])+A[0][0]
for i in range(N-1) :
tmp = sum(A[0][:i+2]) + sum(A[1][i+1:])
if ans < tmp :
ans = tmp
else :
print(ans) | 89 |
Project_CodeNet | 2,019 | n=int(input())
#a,b=map(int,input().split())
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
ans=0
for i in range(n):
ans=max(ans,sum(a[:i+1])+sum(b[i:]))
print(ans)
| 66 |
Project_CodeNet | 2,018 | N = int(input())
A = [list(map(int, input().split())) for i in range(2)]
ans = 0
for i in range(N):
ans = max(ans, sum(A[0][:i+1])+sum(A[1][i:]))
print(ans)
| 60 |
Project_CodeNet | 2,018 | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
m = a[0] + sum(b)
c = m
for i in range(n-1):
x = a[i+1] - b[i]
c += x
if c > m:
m = c
print(m)
| 81 |
Project_CodeNet | 2,018 | import sys
def get_read_func(fileobject):
if fileobject == None :
return raw_input
else:
return fileobject.readline
def main():
if len(sys.argv) > 1:
f = open(sys.argv[1])
else:
f = None
read_func = get_read_func(f);
input_raw = read_func().strip().split()
[... | 304 |
Project_CodeNet | 2,020 | N = int(input())
INF = 10**10
dp = [[-INF]*2 for i in range(N+1)]
dp[0][0] = 0
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
for i, (a1,a2) in enumerate(zip(A1,A2)):
# 右
dp[i+1][0] = dp[i][0] + a1
# 下
dp[i+1][1] = max(dp[i][1] + a2, dp[i+1][0] + a2)
print(max(dp[N])) | 138 |
Project_CodeNet | 2,018 | N = int(input())
if N == 1:
print(int(input()) + int(input()))
quit()
A = [list(map(int, input().split())) for i in range(2)]
dp = [[0] * N for i in range(N)]
for i in range(2):
for j in range(N):
dp[i][j] = A[i][j]
if i > 0:
dp[i][j] = max(dp[i][j], dp[i - 1][j] + A[i][j])
if j > 0:
dp[i][j] = max(dp[i]... | 156 |
Project_CodeNet | 2,019 | import sys
import copy
N = int(input())
A = []
for _ in range(2):
*a, = map(int, input().split())
A.append(a)
max = 0
def dfs(x, y, count):
global max
if x < 0 or y < 0 or x >= N or y >= 2:
return
count = count + A[y][x]
if x==(N-1) and y==1:
if max < count:
ma... | 151 |
Project_CodeNet | 2,019 | N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
s = A1[0] + sum(A2)
ts = s
for i in range(1, N):
ts += A1[i] - A2[i - 1]
s = max(ts, s)
print(s)
| 78 |
Project_CodeNet | 2,018 | import numpy as np
N = int(input())
a = np.zeros((2, N)).astype(int)
for i in range(2):
a[i] = [int(_) for _ in input().split()]
dp = np.zeros((2, N)).astype(int)
dp[0][0] = a[0][0]
dp[1][0] = dp[0][0] + a[1][0]
for j in range(1, N):
dp[0][j] = dp[0][j - 1] + a[0][j]
dp[1][j] = max(dp[0][j], dp[1][j ... | 164 |
Project_CodeNet | 2,018 | N = int(input())
x1 = input()
x2 = input()
for i in range(N):
arr1 = list(map(int, x1.split()))
for i in range(N):
arr2 = list(map(int, x2.split()))
sumarr2 = 0
for i in range(N):
sumarr2 += arr2[i]
sum = arr1[0] + sumarr2
for i in range(1, N):
temp = 0
for j in range(i):
temp += arr1[j]
... | 149 |
Project_CodeNet | 2,019 | import numpy as np
n = int(input())
a1 = np.array([int(i) for i in input().split()])
a2 = np.array([int(i) for i in input().split()])
ans = 0
for i in range(n):
ans = max(ans,(a1[0:i+1].sum()+a2[i:].sum()))
print(ans) | 78 |
Project_CodeNet | 2,020 | N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
m=A[0]+sum(B)
test=A[0]+sum(B)
if N==1:
print(m)
else:
for i in range(1,N):
test+=A[i]-B[i-1]
if test>m:
m=test
print(m) | 80 |
Project_CodeNet | 2,018 | n = int(input())
c = [list(map(int, input().split())) for i in range(2)]
total = sum(c[0]) + c[1][-1]
max_v = total
for i in range(n-2, -1, -1):
total = total - c[0][i+1] + c[1][i]
max_v = max(total, max_v)
print(max_v) | 90 |
Project_CodeNet | 2,018 | n = int(input())
a = []
for i in range(2):
a.append(list(map(int, input().split())))
tempSum = sum(a[1]) + a[0][0]
sumMax = tempSum
for i in range(1, n):
tempSum += a[0][i] - a[1][i - 1]
if tempSum > sumMax:
sumMax = tempSum
print(sumMax)
| 96 |
Project_CodeNet | 2,018 | N = int(input())
A1 = [int(a) for a in input().split()]
A2 = [int(a) for a in input().split()]
maxi = prev = A1[0] + sum(A2)
for i in range(1, N):
cur = prev + A1[i] - A2[i-1]
maxi = max(maxi, cur)
prev = cur
print(maxi) | 91 |
Project_CodeNet | 2,019 | n = int(input())
a = [list(map(int, (input()).split())) for _ in range(2)]
ans = 0
for i in range(n):
ans = max(ans, sum(a[0][0:i+1])+sum(a[1][i:]))
print(ans)
| 62 |
Project_CodeNet | 2,019 | import numpy as np
N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
dp = np.zeros(N, dtype=int)
ans = 0
if N == 1:
print(A1[0] + A2[0])
else:
for i in range(N):
if np.sum(A1[:i]) + np.sum(A2[i-1:]) > ans:
ans = np.sum(A1[:i]) + np.sum(A2[i-1:])
print(int(ans)) | 116 |
Project_CodeNet | 2,018 | import sys
if __name__ == '__main__':
a = int(input())
l = [[int(i) for i in input().split()] for i in range(2)]
mx = 0
for i in range(a):
t = sum(l[0][0:i+1]) + sum(l[1][i:])
if t > mx:
mx = t
print(mx) | 85 |
Project_CodeNet | 2,019 | n = int(input())
a = [None]*2
a[0] = list(map(int,input().split()))
a[1] = list(map(int,input().split()))
dp = [[0]*n for i in range(2)]
dp[0][0] = a[0][0]
for i in range(n):
if i == 0:
dp[1][i] = dp[0][i]+a[1][i]
else:
dp[0][i] = dp[0][i-1]+a[0][i]
dp[1][i] = max(dp[0][i],dp[1][i-1])+... | 158 |
Project_CodeNet | 2,018 | #!/usr/bin/env python
if __name__ == '__main__':
n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
res = 0
for i in range(n):
res = max(res, sum(a1[:i+1]) + sum(a2[i:]))
print(res)
| 82 |
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):#N番目で下に
curr = 0
for j in range(i+1):
curr += A[j]
for j in range(i,N):
curr += B[j]
ans = max(ans,curr)
print(ans) | 89 |
Project_CodeNet | 2,018 | N=int(input())
A1=list(map(int,input().split()))
A2=list(map(int,input().split()))
a=0
for i in range(1,N+1):
if a<sum(A1[:i])+sum(A2[i-1:]):
a=sum(A1[:i])+sum(A2[i-1:])
print(a) | 72 |
Project_CodeNet | 2,018 | N = int(input())
_A1 = [int(x) for x in input().split()]
_A2 = [int(x) for x in input().split()]
A1 = [0] * (N)
A2 = [0] * (N)
for i in range(0, N):
if i == 0:
A1[i] = _A1[i]
A2[i] = _A2[i]
else:
A1[i] = A1[i - 1] + _A1[i]
A2[i] = A2[i - 1] + _A2[i]
sum = 0
for i in range(0,... | 203 |
Project_CodeNet | 2,018 | # coding: utf-8
# Your code here!
num = int(input())
line = lambda x: [int(i) for i in input().split(' ')]
a = line(1)
b = line(1)
masume = {}
for i in range(num):
masume[(i, 0)] = a[i]
masume[(i, 1)] = b[i]
def change(index, masume):
return masume[(index+1, 0)] - masume[(index, 1)]
first = sum(... | 183 |
Project_CodeNet | 2,020 | # author: Taichicchi
# created: 27.09.2020 23:51:44
import sys
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] + A2[i:])
ans = max(ans, tmp)
print(ans)
| 95 |
Project_CodeNet | 2,020 | n = int(input())
a = [0 for _ in range(2)]
for i in range(2):
a[i] = [int(x) for x in input().strip().split()]
b1 = a[0][0]
b2 = sum(a[1])
ans = b1 + b2
for i in range(1, n):
b1 += a[0][i]
b2 -= a[1][i-1]
ans = max(ans, b1+b2)
print(ans) | 111 |
Project_CodeNet | 2,019 | N = int(input())
A = []
A.append(list(map(int, input().split())))
A.append(list(map(int, input().split())))
cumsum = []
for i in range(2):
c = []
for j in range(N):
c.append(A[i][j] + (c[j - 1] if j - 1 >= 0 else 0))
cumsum.append(c)
res = 0
for j in range(N):
row0 = cumsum[0][j];
row1 = c... | 160 |
Project_CodeNet | 2,018 | N = int(input())
A = []
A.append([int(n) for n in input().split()])
A.append([int(n) for n in input().split()])
res = 0
for i in range(N):
res = max(res, sum(A[0][:i+1]) + sum(A[1][i:]))
print(res)
| 73 |
Project_CodeNet | 2,019 | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(N - 1):
ans = max(ans, sum(A[:i + 1]) + sum(B[i:]))
ans = max(ans, sum(A) + B[-1])
print(ans) | 75 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.