Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | import numpy as np
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
A = np.array(read().split(), np.int64)
I = np.argsort(A)[::-1].tolist()
A = A[I].tolist()
dp = np.zeros(1, np.int64)
for n, (i, x) in enumerate(zip(I, A)):
ne... | 207 |
Project_CodeNet | 2,020 | import sys
try:
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
except:
pass
input = sys.stdin.readline
n = int(input())
arr = list(map(int,input().split()))
arr = list(enumerate(arr))
arr.sort(reverse = True, key = lambda x:(x[1]))
dp = [[0 for c in range(n+1)] for r in range(n+1)]
ans ... | 329 |
Project_CodeNet | 2,020 | n=int(input())
a= list(map(int, input().split()))
# aの各要素とインデックスを紐付け
for i in range(n):
a[i]=[a[i],i]
a.sort(reverse=True)
# dp[i][l]:大きいものからi個位置決めてそのうち左がl（右がi-l）の時のMAX
dp=[[0]*(n+1) for i in range(n+1)]
for i in range(n):
for j in range(i+1):
# i番目を左に置く時、左に一つズレる
dp[i+1][j+1]=dp[i][j]+abs(a[i... | 236 |
Project_CodeNet | 2,020 |
"""
Writer: SPD_9X2
https://atcoder.jp/contests/abc163/tasks/abc163_e
dpか？
なにを基準にdpすればよい？
まとめられる状態は？
小さいことを考えると貪欲かなぁ
かいてみるか
挿入dp?
前から決めていけば、累積和で減る量がわかる
&増える寄与も計算できる
O(N**2)
全探索はむり
======答えを見ました======
今より右に行く、左に行くの集合に分けたとすると
大きい奴をより左にする方が最適
よって、途中まで単調減少、途中から単調増加が最適であるとわかる
dp[大きい方からi番目まで見た][左にl個つめた] = 最大値
で解ける
"""... | 448 |
Project_CodeNet | 2,020 | n = int(input())
A = list(map(int, input().split()))
p = []
for i, v in enumerate(A):
p.append((v, i))
p.sort(reverse=True)
dp = [[0] * (n + 1) for _ in range(n + 1)]
for i in range(n):
k = p[i][0]
r = p[i][1]
for x in range(i + 1):
y = i - x
dp[x + 1][y] = max(dp[x + 1][y], dp[x][y] + abs(r - x) ... | 199 |
Project_CodeNet | 2,020 | N = int(input())
As = list(map(int, input().split()))
dp = [[0] * (N-k+1) for k in range(N+1)]
s = 0
for i, A in sorted(enumerate(As), key = lambda t:t[1], reverse=True):
s += 1
for x in range(s+1):
y = s - x
if x > 0 and y > 0:
dp[x][y] = max(dp[x-1][y] + A * (i - x + 1), dp[x][y-... | 219 |
Project_CodeNet | 2,020 | import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
mod = 10**9 + 7
def main():
N = int(input())
A = list(map(int, input().split()))
B = []
for i, a in enumerate(A):
B.append((a, i + 1))
B.sort()
#print(B)
"""
活発度が大きい方から左右どちらかの端に移動させるが左右どち... | 489 |
Project_CodeNet | 2,020 | def main():
N = int(input())
A = list(map(int, input().split()))
AA = [(a, i) for i, a in enumerate(A)]
AA.sort(reverse=True)
dp = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(N):
a, t = AA[i]
for x in range(i + 2):
y = i + 1 - x
dp[x][y] = max((dp... | 191 |
Project_CodeNet | 2,020 | n=int(input())
a=[[int(_),0] for _ in input().split()]
for i in range(n): a[i][1]=i
a.sort(reverse=True)
dp=[[0 for _ in range(n)] for __ in range(n)]
for l in range(n):
for r in range(n):
if l+r < n:
if l<n-1:dp[l+1][r]=max(dp[l+1][r], dp[l][r]+a[l+r][0]*abs(a[l+r][1]-l))
if r<n-1:d... | 177 |
Project_CodeNet | 2,020 |
def main():
n = int(input())
a = list(map(int, input().split()))
a = sorted([(j, i) for i, j in enumerate(a)])[::-1]
dp = [0]
for i in range(n):
dp2 = [0]*(i+2)
A, p = a[i]
for j in range(i+1):
right = n-i-1+j
dp2[j] = max(dp2[j], dp[j]+abs(p-right)*A... | 150 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
infants = [[i, A[i]] for i in range(N)]
infants.sort(key=lambda x:x[1], reverse=True)
dp = [[0 for _ in range(N+1)] for _ in range(N+1)]
for x in range(N):
for y in range(N-x):
pos, infant = infants[x+y]
dp[x][y+1] = max(dp[x][y+1], dp[x][y]+in... | 173 |
Project_CodeNet | 2,020 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_left, bise... | 508 |
Project_CodeNet | 2,020 | n = int(input())
a = sorted([x, i] for i, x in enumerate(list(map(int, input().split()))))
f = [[0 for j in range(n)] for i in range(n)]
for i in range(n-1, -1, -1):
f[i][i] = a[0][0]*abs(a[0][1]-i)
for j in range(i+1, n):
f[i][j] = max(f[i+1][j]+a[j-i][0]*abs(a[j-i][1]-i), f[i][j-1]+a[j-i][0]*abs(a[j-i... | 152 |
Project_CodeNet | 2,020 | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
im... | 344 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(2000 * 2)
n = int(input())
a = list(map(int, input().split()))
a = [(i, v) for i, v in enumerate(a)]
a.sort(key=lambda x: x[1], reverse=True)
dp = [[-1] * (m + 1) for m in range(n + 1)]
# m: 何人選んだか, l: 左を選んだ人数
def f(m, l):
if m == n: return 0
if dp[m][l] != -1: return dp[m][l]
... | 255 |
Project_CodeNet | 2,020 | # スコアが高い順に右端 or 左端に置く事を考える
# dp[i][l] : l番目まで左に子がいる状態でi番目の子を動かす時の最大値
n = int(input())
tmp = [int(x) for x in input().split()]
aList=[]
for i in range(n):
aList.append([tmp[i],i])
aList.sort(reverse=True)
dp=[[int(-1) for i in range(n+1)] for j in range(n+1)]
dp[0][0] = 0
# スコアが高い順にi人動かす
for i in range(n):
#... | 378 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.buffer.readline
from operator import itemgetter
def main():
N = int(input())
a = list(map(int,input().split()))
active = []
for i in range(N):
active.append((a[i],i))
active.sort(key=itemgetter(0),reverse=True)
dp = [[0]*(N+1) for _ in range(N+... | 234 |
Project_CodeNet | 2,020 | N = int(input())
A = [int(s) for s in input().split(" ")]
ABI = sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True)
prev = [0]
for k, (a,i) in enumerate(ABI):
curr = [0]*(k+2)
for l in range(k+1):
curr[l] = max(curr[l], prev[l]+abs(N-i-k+l)*a)
curr[l+1] = prev[l]+abs(i-l-1)*a
prev = curr
prin... | 125 |
Project_CodeNet | 2,020 | N = int(input())
def solve(a, i, prev):
r = N - len(prev) - i + 1
p = -i*a
for j, s in enumerate(prev):
yield p+abs(j-i)*a, s+abs(j+r)*a
p = s
yield s+abs(len(prev)-i)*a,
pd = [0]
A = map(int, input().split())
for a,i in sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True):
pd = [*map(max, sol... | 134 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
A = [(a, i) for i, a in enumerate(A)]
A.sort(reverse = True)
dp = [[0]*(N+1) for _ in range(N+1)]
ans = 0
for l in range(N):
for r in range(N):
if l+r == N:
ans = max(ans, dp[l][r])
break
else:
a, i = A[l+r]... | 169 |
Project_CodeNet | 2,020 | N=int(input())
alist=list(map(int,input().split()))
a2list=[]
for i in range(N):
a2list.append((alist[i],i))
a2list.sort(reverse=True)
#print(a2list)
dp=[]
for i in range(N+1):
dp.append([0]*(N+1))
#print(dp)
for i in range(1,N+1):
aa,ii=a2list[i-1]
for j1 in range(i+1):
j2=i-j1
if j1==0:
dp[j1... | 270 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
infants = []
for i,a in enumerate(A):
infants.append((a, i))
infants.sort(reverse=True)
dp = [[0 for _ in range(N+1)] for _ in range(N+1)]
for i in range(N):
for j in range(i+1):
dp[j+1][i-j] = max(dp[j+1][i-j], dp[j][i-j] + infants[i][0] * abs(infa... | 194 |
Project_CodeNet | 2,020 | # 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
n,*A = get_all_int()
# dp[i][j] = 活発度高い順のi人目まで処理し、左にjに置いた場合のうれしさの最大
dp = [ [0] * (n+1) for _ in range(n+1) ]
AA = list(enumerate(A))
AA.sort(key=(lambda t: t[1]), reverse=True)
for i, t in enumerate(AA):
# k 移動前... | 345 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
dp = [[0] * (n+1) for _ in range(n+1)]
p = []
for i in range(n):
p.append((a[i], i))
p.sort(key=lambda x: -x[0])
for i in range(n):
pi = p[i][1]
for l in range(i+1):
r = i - l
dp[i+1][l+1] = max(dp[i+1][l+1], dp[i][l] + (pi-l)*a[pi])
... | 190 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int,input().split()))
ans = 0
place = [0]*n
active = sorted(a,reverse=True)
for i in range(n):
place[i] = a.index(active[i])
a[a.index(active[i])] = -1
#dp[x][y] x,y:0~n+1 (x[-1]=x[n+1]=0にすることで端の処理を楽にする)
dp = [[0 for i in range(n+2)]for j in range(n+2)]
for i in range(n):
dp[... | 300 |
Project_CodeNet | 2,020 | import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
if row <= 0:
... | 449 |
Project_CodeNet | 2,020 | n=int(input())
a=list(map(int,input().split()))
li = list(enumerate(a))
li.sort(key = lambda x:x[1])
li.reverse()
dp = [[0 for _ in range(n+1)]for __ in range(n+1)]
ans = 0
for i in range(n+1):
for j in range(n+1):
cnt = i + j
if cnt == 0: continue
if cnt > n: continue
if i == 0:
... | 293 |
Project_CodeNet | 2,020 | import sys
readline = sys.stdin.buffer.readline
import numpy as np
n = int(readline())
a = np.array(readline().split(), np.int64)
ai = np.argsort(a)[::-1]
a = a[ai]
ai += 1
dp = np.zeros(n + 1, np.int64)
for k, (i, e) in enumerate(zip(ai, a), 1):
dp_new = dp.copy()
add_left = e * np.abs(np.arange(1, k + 1)... | 203 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int,input().split()))
for i in range(n):
a[i] = [a[i],i]
l1 = 0
r1 = n-1
l2 = l1
r2 = r1
a.sort(reverse=1)
dp = [[0]*(n+1) for i in range(n+1)]
ans = 0
for i in range(1,n+1):
dp[i][0] = dp[i-1][0] + a[i-1][0] * abs(a[i-1][1]-i+1)
dp[0][i] = dp[0][i-1] + a[i-1][0] * abs(n-(a[i-... | 256 |
Project_CodeNet | 2,020 | #pythonじゃ通らなかった…(´・ω・`)
n = int(input())
a = list(map(int,input().split()))
ans = [[0 for i in range(n+1)] for j in range(n+1)]
p = []
#それぞれの活発度と元々居た位置の記録
for i in range(n):
p.append([a[i],i])
p.sort(reverse=True)
#活発度の高い順にそれぞれ左と右から詰めて並べていく時のうれしさの変化
for i in range(1,n+1):
ans[0][i] = ans[0][i-1] + p[i-1][0]*a... | 426 |
Project_CodeNet | 2,020 | def main():
from operator import itemgetter
N = int(input())
a = map(int, input().split())
*ea, = enumerate(a, 1)
ea.sort(key=itemgetter(1), reverse=True)
dp = [[0] * (N + 1) for _ in range(N + 1)]
# dp[left][right]:=活発な幼児から順に左端からleft,右端からright並べた際の最大うれしさ
for i, (p, x) in enumerate(... | 270 |
Project_CodeNet | 2,020 | N = int(input())
A = [(a, i) for i, a in enumerate(map(int, input().split()), start=1)]#(Ai,i)を作成 iはスタート位置
A.sort(reverse=True)#Aiが大きい順にソート
dp = [[0] * (N + 1) for _ in range(N + 1)]
#dp[l][r]=l人は左、r人は右に配置した時の最大スコア
for s, (a, i) in enumerate(A):#Ai大きい順にs人動かした場合
for l in range(s + 1):#0~s人うごかした時を考える s=l+r。
... | 326 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(5000)
N = int(input())
A = [(int(a), i) for i, a in enumerate(input().split())]
A = sorted(A, reverse=True)
memo = {}
def solve(i, l, r):
if i==N: return 0
key = l*N+r
if key in memo: return memo[key]
a, loc = A[i]
score_l = a*abs(l-loc) + solve(i+1, l+1, r)... | 170 |
Project_CodeNet | 2,020 | # E - Active Infants
n = int(input())
a = list(map(int, input().split()))
assert len(a) == n
# 添字のリスト
p = list(range(n))
p.sort(key=lambda i: a[i])
# dp[j] = 位置jから幅iの区間に小さい方からi個を配置したときの最大うれしさ
dp = [0] * (n + 1)
for i in range(n):
for j in range(n - i):
dp[j] = max(dp[j] + a[p[i]] * abs(p[i] - (j + i... | 166 |
Project_CodeNet | 2,020 | N = int(input())
a = map(int,input().split())
A = sorted([(b,a) for a, b in enumerate(a)])[::-1]
dp = [[-1 for _ in range(N+10)]for _ in range(N+10)]
#dp[x][y]: 活発度順でx+y人詰めた時,左にx人右にy人詰めたときの最大値
dp[0][0] = 0
import sys
sys.setrecursionlimit(100000000)
def memo(x, y):
if x < 0 or y < 0: return -1000000000000 #ありえん
... | 299 |
Project_CodeNet | 2,020 | #!python3
iim = lambda: map(int, input().rstrip().split())
def resolve():
N = int(input())
A = list(enumerate(iim()))
A.sort(key=lambda x: (x[1], (2*x[0]-N)**2), reverse=True)
dp = [0] * (N+1)
dp0 = dp[:]
for i, (j, ai) in enumerate(A):
for k in range(i+1):
dp[k] = max(dp... | 179 |
Project_CodeNet | 2,020 | n=int(input())
a=list(map(int,input().split()))
for i in range(n):
a[i]=[a[i],i]
a.sort()
a.reverse()
dp=[[0 for i in range(n+1)] for j in range(n+1)]
for i in range(n):
for j in range(n):
if i+j<=n-1:
dp[i+1][j]=max(dp[i+1][j],dp[i][j]+a[i+j][0]*abs(a[i+j][1]-i))
dp[i][j+1]=max(dp[i][j+1],dp[i][j]+... | 171 |
Project_CodeNet | 2,020 | class BIT():
def __init__(self, n):
self.size = n
self.bit = [0] * (n + 1)
def _sum(self, i):
s = 0
while i > 0:
s += self.bit[i]
i -= i & -i
return s
def add(self, i, val):
i += 1
while i <= self.size:
self.bit[i]... | 369 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(input())
A = list(map(int, input().split()))
A_and_i = [[a, i] for i, a in enumerate(A)]
A_and_i.sort(reverse=True)
DP = [[0] * (N + 1) for _ in range(N + 1)]
f... | 230 |
Project_CodeNet | 2,020 | from collections import *
import itertools
import sys
sys.setrecursionlimit(10**5)
try: inp = raw_input
except: inp = input
def err(s):
sys.stderr.write('{}\n'.format(s))
def ni():
return int(inp())
def nl():
return [int(_) for _ in inp().split()]
N = ni()
A = nl()
X = sorted(enumerate(A), key=lambda x:... | 250 |
Project_CodeNet | 2,020 | from collections import defaultdict
#dpa[(0,0)] = 0
n = int(input())
a = list(map(int, input().split()))
d = {}
for i in range(n):
d[i] = a[i]
dp = defaultdict(lambda: 0)
i = 0
x = 0
y = 0
maxr = 0
for k,v in sorted(d.items(), key=lambda x: -x[1]):
i+=1
# print(k,": ",v)
for j in range(i+1):
if j == 0:
mi... | 255 |
Project_CodeNet | 2,020 | N=int(input())
A=list(map(int, input().split()))
A=sorted([(a,p) for p, a in enumerate(A)])[::-1]
dp=[[0]*(N+1) for _ in range(N+1)]
for i,(a,p) in enumerate(A):
for j in range(i+1):
#左詰
dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]+(p-j)*a)
#右詰
dp[i+1][j]=max(dp[i+1][j],dp[i][j]+((N-1-(i-j))-p)*a)
print(ma... | 149 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.readline
n = int(input())
A = list(map(int,input().split()))
B = [[A[i], i] for i in range(n)]
B.sort(reverse=True)
DP = [[0] * (n+1) for i in range(n)]
DP[0][0] = B[0][0] * B[0][1]
DP[0][1] = B[0][0] * (n-1-B[0][1])
for i in range(1, n):
ind = B[i][1]
for j in range(i+2):
... | 242 |
Project_CodeNet | 2,020 | import itertools
def main():
N = int(input())
A = list(map(int, input().split()))
X = [(A[i], i) for i in range(N)]
X.sort(reverse=True)
l = 0
r = N-1
ans = 0
dp = [[0] * (i+1) for i in range(N+1)]
for i in range(N):
cost, prev = X[i]
dp[i+1][0] = dp[i][0] + cost * ... | 243 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
babies = [(a, i) for i, a in enumerate(a)]
babies.sort(reverse=True)
dp = [[0 for _ in range(n+1)] for _ in range(n+1)]
ans = 0
for l in range(n):
for r in range(n):
if l+r == n:
ans = max(ans, dp[l][r])
break
activeness, ind = babies[l+r]
... | 177 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
a2 = []
for i in range(n):
a2.append((a[i], i))
a2.sort(reverse=True)
dp = [[-1] * n for _ in range(n)]
for i2 in range(n-1, -1, -1):
a, i = a2[i2]
for s in range(i2+1):
if i2 == n-1:
dp[i2][s] = a * abs(s-i)
else:
... | 172 |
Project_CodeNet | 2,020 | def main():
n=int(input())
A=list(zip(list(map(int,input().split())),range(n)))
A.sort(reverse=True)
DP=[[0]*(n+1) for _ in range(n+1)]
for i in range(n+1):
for j in range(n+1):
if i+j>n:
break
a,idx=A[i+j-1]
if i>0:
DP[i][j... | 191 |
Project_CodeNet | 2,020 | N = int(input())
A = [int(s) for s in input().split(" ")]
ABI = sorted(((a, i) for i, a in enumerate(A, 1)), reverse=True)
prev = [0]
for k, (a,i) in enumerate(ABI):
curr = [0]*(k+2)
for l in range(k+1):
curr[l] = max(curr[l], prev[l]+abs(N-i-k+l)*a)
curr[l+1] = prev[l]+abs(i-l-1)*a
prev = curr
pri... | 125 |
Project_CodeNet | 2,020 | n = int(input())
a = [(int(x), int(y)) for x, y in zip(input().split(), range(n))]
a.sort(reverse=True)
dp = [[0]*(n+1) for i in range(n+1)]
for i in range(n+1):
for j in range(n+1-i):
if i == 0 and j == 0:
continue
if i == 0:
dp[i][j] = dp[i][j-1]+a[i+j-1][0]*abs(a[i+j-1][1]-j+1)
continue
... | 268 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
assert len(a) == n
# 添字のリスト
p = list(range(n))
p.sort(key=lambda i: a[i])
# dp[j] = 位置jから幅iの区間に小さい方からi個を配置したときの最大うれしさ
dp = [0] * (n + 1)
for i in range(n):
for j in range(n - i):
dp[j] = max(dp[j] + a[p[i]] * abs(p[i] - (j + i)),
... | 159 |
Project_CodeNet | 2,020 | n = int(input())
ai = [int(i) for i in input().split()]
ai_li = []
for i in range(n):
ai_li.append([ai[i],i+1])
ai_li.sort(reverse=True)
dp = [[0 for i in range(n+1)] for j in range(n+1)]
for i in range(1,n+1):
#print(i)
for j in range(0,i+1):
if i == 1:
if j == 1:
... | 376 |
Project_CodeNet | 2,020 | import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): r... | 307 |
Project_CodeNet | 2,020 | N = gets.to_i
As = gets.split.map(&:to_i)
mx = ->(a, b){a > b ? a : b}
ab = ->(a, b){(a - b).abs}
as = As.map.with_index.sort_by(&:first).reverse
dp = Array.new(N + 1){Array.new(N + 1, 0)}
(0 ... N).each do |l|
(0 ... N - l).each do |r|
a, p = as[l + r]
dp[l + 1][r] = mx[dp[l + 1][r], dp[l][r] + a*ab[p, l]]
... | 206 |
Project_CodeNet | 2,020 | N = gets.to_i
A = gets.split(" ").map(&:to_i)
arr = Array.new(N, nil)
N.times do |i|
arr[i] = [i, A[i]]
end
arr.sort! { |a, b| b[1] <=> a[1] }
dp = Array.new(N+1) { Array.new(N+1, 0) }
N.times do |i|
loc = arr[i][0]
val = arr[i][1]
0.upto(i) do |left|
right = i - left
dp[left+1][right] = [dp[left+1]... | 238 |
Project_CodeNet | 2,020 | N,*as=$<.read.split.map(&:to_i)
as = as.map.with_index.sort_by {|a,i|-a}
dp = [0] * (N+1)
N.times do |i|
a,idx = as[i]
dp_ = [0] * (N+1)
0.upto(i) do |j|
dp_[j+1] = dp[j]+a*(idx-j).abs
dp_[j] = [dp_[j], dp[j]+a*(N-1-i-(idx-j)).abs].max
end
dp = dp_
end
puts dp.max
| 136 |
Project_CodeNet | 2,020 | N = gets.to_i
A = gets.chomp.split.map(&:to_i)
A = A.map.with_index { |elem, index| [index, elem]}
A = A.sort_by { |a| a[1] }.reverse
dpnxy = [[0,0]]
dpnxy1 = []
dpn = [0]
dpn1 = []
(1..N).each do |n|
(0..(dpnxy.length-1)).each do |i|
x = dpnxy[i][0]
y = dpnxy[i][1]
n_left = x
n_right = N-1-y
... | 387 |
Project_CodeNet | 2,020 | n = gets.to_i
happy = gets.split.map(&:to_i)
happy.unshift 0 # ダミー
# happyが多い順にインデックスを並び替える
sorted_index = (1..n).sort_by{|i| -happy[i]}
sorted_index.unshift 0 # ダミー
# happyが多い順に左端もしくは右端に入れていく
# 左端にleft人、右端にright人入ってるときの嬉しさを
# happysum[left][right]で表すことにする。
# これは、左端に入れたときの嬉しさ
# happysum[left-1][right] + happy[i] * (i... | 571 |
Project_CodeNet | 2,020 | n = gets.to_i
a = gets.split.map(&:to_i)
ary = []
a.each_with_index{|x, i| ary.push([x, i]) }
ary = ary.sort{|lhs, rhs| rhs[0] <=> lhs[0] }
left = 0
right = 0
dp = Array.new(n) { Array.new(n + 1) { 0 } }
ary.each_with_index do |el, i|
(0..i).each do |j|
left = j
right = i - j
current = 0
cur... | 260 |
Project_CodeNet | 2,020 | def max(a,b); a > b ? a : b; end
Child = Struct.new(:value, :pos)
N = gets.to_i
A = gets.split.map(&:to_i).each_with_index.map{|a,i| Child.new(a, i + 1) }.sort_by(&:value).reverse
dp = Array.new(N + 1){ Array.new(N + 1, 0) }
ans = 0
A.each.with_index(1) do |c, n|
x = c.pos
v = c.value
# padding all from left... | 272 |
Project_CodeNet | 2,020 | N=gets.to_i
A=gets.split.map(&:to_i).zip(1..N).sort.reverse
@memo=Array.new(N){Array.new(N)}
def dfs(i,l)
return 0 if i==N
return @memo[i][l] if @memo[i][l]
x=A[i][0]*A[i][1]
y=A[i][0]*(1+l)
z=A[i][0]*(N-(i-l))
@memo[i][l] = [x-y+dfs(i+1,l+1), z-x+dfs(i+1,l)].max
end
p dfs(0,0) | 138 |
Project_CodeNet | 2,020 | n, *a = $<.read.split.map(&:to_i)
a = a.map.with_index{|t,i| [t,i] }.sort_by{|(t,_)| -t }
dp = [0] * (n+1)
a.each_with_index do |(a, k), i|
dp_ = [0] * (n+1)
(i+1).times do |j|
dp_[j+1] = dp[j] + (k -j) * a
dp_[j] = [ dp_[j], dp[j] + (n-i+j-1-k) * a ].max
end
dp = dp_
end
... | 154 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using Library;
namespace Program
{
public static class ABC163E
{
static bool SAIKI ... | 1,602 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using static Assistant.Input;
using static Assistant.Debug;
using System.Linq;
using Assistant;
namespace ABC163E
{
class Program
{
static void Main(string[] args)
{
var N = RInt;
var A = RLongs;
Mem[] mem = ne... | 1,011 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.Linq;
namespace contest_Csharp
{
class Program
{
static void Main(string[] args)
{
var vals = Console.ReadLine().Split(' ')
.Select(x => int.Parse(x)).ToList();
var N = vals[0];
//v... | 450 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.Linq;
using static System.Math;
namespace CSharp
{
static class Program
{
static void Main(string[] args)
{
ReadString();
var A = ReadLongArray().Select((Value, Index) => (Value, Index)).OrderByDescending(x => ... | 804 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, i... | 2,044 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
using static System.Math;
namespace AtTest.ForYellow
{
class ABC_163
{
static void Main(string[] args)
{
var sw = new System.IO.StreamWriter(OpenStandardOutput()) { AutoFlush = false };
... | 564 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using static System.Console;
using static System.Math;
using static MyIO;
using static MyUtil;
public class E { public static void Main() => (new Solver()).Solve(); }
public class Solver
{
publ... | 883 |
Project_CodeNet | 2,020 | using AtCoderBeginnerContest163.Algorithms;
using AtCoderBeginnerContest163.Collections;
using AtCoderBeginnerContest163.Questions;
using AtCoderBeginnerContest163.Extensions;
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Diagnostics.CodeAnalysis;
n... | 7,368 |
Project_CodeNet | 2,020 | using System;
using System.Linq;
using System.Collections.Generic;
namespace Contest
{
class Program
{
static void Main(string[] args)
{
ABC162.E();
}
class ABC162
{
public static void A()
{
var R = Read.Int();
... | 3,112 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;
using Library;
using static Library.Input;
namespace AtCoderTemplate
{
class ProgramE
{
static void Main()
{
int n = NextInt;
var list = LongList;
var ord... | 474 |
Project_CodeNet | 2,020 | #region いつもの
using AtCoderProject;
using System;
using System.Collections.Generic;
using System.Linq;
using static AtCoderProject.Global;
using BigInteger = System.Numerics.BigInteger;
using IEnumerable = System.Collections.IEnumerable;
using IEnumerator = System.Collections.IEnumerator;
using StringBuilder = System.Te... | 5,304 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Numerics;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Diagnostics;
using static System.Math;
using static System.Array;
using static AtCoder.Cout;
using static AtCoder.Tool... | 4,111 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Program
{
static void Main(string[] args)
{
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
Console.SetOut(sw);
Solve();
Console.Out.Flush();
}
static... | 1,393 |
Project_CodeNet | 2,020 | using System;
using System.Linq;
using System.Collections.Generic;
using System.Collections;
namespace AtCoder.Contests.ABC163
{
/// <summary>
///
/// </summary>
static class E
{
static void Main(string[] args)
{
var n = NextInt();
var aas = ReadLongArray();... | 1,545 |
Project_CodeNet | 2,020 | using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;
using E = System.Linq.Enumerable;
internal partial class Solver {
public void Run() {
var n = ni();
var a = ni(n);... | 1,688 |
Project_CodeNet | 2,020 | /*******************************************************************************
* Author: Nirushuu
*******************************************************************************/
using System;
using System.Collections.Generic;
using System.Linq;
using System.Windows;
using System.IO;
using System.Globalization;
usin... | 1,870 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
// using System.Numerics;
using System.Runtime.CompilerServices;
using System.Diagnostics;
using ll=System.Int64;
using static Contest_E.Lib_IO;
using static Contest_E.Lib_Minifunc;
public static class Contest_E
{
public static ... | 2,699 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
namespace AtCoder
{
public class Program
{
static void Main()
{
var cin = new Scanner();
int n = cin.Int();
var a = cin.ArrayLong(n);
var b = new (int index, long a)[n];
for (int i = 0; i < n; i++) {
b[i] = (i... | 1,507 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
namespace V
{
partial class Solver
{
public void Solve()
{
Write(SolveLong());
//YesNo(SolveBool());
}
public long SolveLong()
{
var n = Read;
... | 9,373 |
Project_CodeNet | 2,020 | using System.Linq;
using static System.Math;
using System;
public class P
{
public long act { get; set; }
public int id { get; set; }
}
public class Hello
{
public static void Main()
{
var n = int.Parse(Console.ReadLine().Trim());
string[] line = Console.ReadLine().Trim().Split(' ');
... | 403 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
static class Program{
const int mod=(int)1e9+7;
const double eps=1e-11;
stat... | 874 |
Project_CodeNet | 2,020 | using System;
using System.Collections.Generic;
using System.Linq;
namespace AtCoder
{
class Abc163E
{
struct Baby
{
public int Index;
public long Value;
public Baby(int index, long value)
{
Index = index;
Value = v... | 320 |
Project_CodeNet | 2,020 | using System;
using System.Linq;
using System.Runtime.CompilerServices;
using CompLib.Util;
public class Program
{
int N;
long[] A;
public void Solve()
{
var sc = new Scanner();
N = sc.NextInt();
A = sc.LongArray();
// A[i]が大きいやつはたくさん移動させたい
// iまで見る、左埋まってる数-右+N... | 794 |
Project_CodeNet | 2,015 | import java.io.PrintWriter;
import java.util.Scanner;
public class Main {
static Scanner sc=new Scanner(System.in);
static PrintWriter pr=new PrintWriter(System.out);
static int temp=50001;
static boolean[] judge=new boolean[temp];
static int[] ans=new int[temp];
public static void main(String[] args) {
judge[0... | 200 |
Project_CodeNet | 2,015 | import java.io.*;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.NoSuchElementException;
import java.util.Scanner;
public class Main {
static int[] list = new int[5133];
public static void main(String[] args... | 773 |
Project_CodeNet | 2,012 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
static boolean[] isPrime = new boolean[50001];
static int[] a = new int[10];
static{
Arrays.fill(isPrime, true);
isPrime[0]=isPrime[1]=false;
for(int i = 2; i*i<= isPrime.length;i++){
if(isPrime[i]){
for(int j = i+i; j < isPrime.le... | 353 |
Project_CodeNet | 2,018 | import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
boolean[] nonPrime = new boolean[50001];
nonPrime[... | 248 |
Project_CodeNet | 2,017 | import java.util.Scanner;
public class Main {
private Scanner sc;
public static void main(String[] args) {
new Main();
}
public Main() {
sc = new Scanner(System.in);
int[] prime = new int[50000];
for (int i = 0; i < prime.length; i++) {
prime[i] = 1;
}
for (int i = 2; i < (prime.length / 2... | 256 |
Project_CodeNet | 2,012 | import java.util.Scanner;
public class Main {
static boolean[] primes;
static void primeSet(final int MAX){
primes = new boolean[MAX+1];
primes[2] = true;
for(int i=3;i<=MAX;i+=2){
primes[i] = true;
}
int rt = (int) Math.sqrt(MAX);
for(int i=3;i<=rt;i+=2){
if(primes[i]){
for(int j=i*2;j<=MAX... | 316 |
Project_CodeNet | 2,012 | import java.util.*;
public class Main {
void AOJ0056(){
int MAX=100000;
boolean[] list = new boolean[MAX+1];
Arrays.fill(list, true);
list[1]=false;
for(int i=2; i<=MAX; i++) {
if(list[i]) {
for (int j=i+i; j<+MAX; j+=i) list[j] = false;
}
}
Scanner sc = new Scanner(System.in);
while(s... | 1,277 |
Project_CodeNet | 2,012 | import java.util.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;
public class Main{
boolean[] p;
int MAX = 50001;
void run() {
p = new boolean[MAX];
for(int i=2;i<MAX;i++) if(!p[i]) {
for(int j=2*i;j<MAX;j+=i) p[j] = true;
}
Scanner sc = new Scanner(System.in);
for(;;) {
int n =... | 193 |
Project_CodeNet | 2,015 |
import static java.util.Arrays.deepToString;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
new Main().run();
}
void tr(Object... os) {
System.err.println(deepToString(os));
}
Scanner sc = new Scanner(System.in);
public void run() {
makePrimes();
for (;sc.hasNex... | 376 |
Project_CodeNet | 2,012 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
class Main {
public static void main(String[] args) throws IOException {
doit(args, System.in, System.out);
}
static void doit(String[] args, InputS... | 371 |
Project_CodeNet | 2,013 | import java.util.Scanner;
public class Main {
static boolean isPrime[] = new boolean[50001];
public static void main(String[] args){
Scanner input = new Scanner(System.in);
for(int i = 1 ; i <= 50000 ; i++){
isPrime[i] = isPrime(i);
}
while(input.hasNext()){
int a = input.nextInt()... | 226 |
Project_CodeNet | 2,012 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
boolean[] getPrime(final int n){
boolean[] list = new boolean[n+1];
for(int i=2; i<=n; ++i){ list[i] = true;}
for(int i=2; i*i<=n; ++i){
if(list[i]){
for(int j=i*2; j<=n; j+=i){
list[j] = false;
}
}
}
return list;
... | 270 |
Project_CodeNet | 2,014 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
// エラトステネスのふるい(n以下の素数を求める)
public static boolean[] sieve (int n) {
boolean[] isPrime = new boolean[n + 1];
Arrays.fill(isPrime, true);
for (int i = 4; i < isPrime.length; i... | 330 |
Project_CodeNet | 2,012 | import java.util.*;
import java.io.*;
public class Main {
public static boolean[] sieve (int n) {
boolean[] isPrime = new boolean[n];
Arrays.fill(isPrime, true);
int lim = (int)Math.sqrt(n);
for (int i = 4; i < isPrime.length; i += 2)
isPrime[i] = false;
for (int i = 3; i <= lim; i += 2) {
... | 311 |
Project_CodeNet | 2,010 | import java.util.Scanner;
class Main
{
public static void main(String args[])
{
boolean not[] = new boolean[100000];
not[0] = true;
not[1] = true;
int pCount = 2;
for (int i = 2; i * i < 100000; i++)
{
if (not[i]) continue;
for (int x = (i << 1); x < 100000; x += i)
{
if (not[x]) continue;
... | 302 |
Project_CodeNet | 2,010 | import java.util.*;class Main{public static void main(String[]z){int m=50001,i,j,n,v,x=5133,c=0;int[]b=new int[m+1],r=b.clone(),p=b.clone();for(i=1;i++<m;)if(b[i]<1)for(p[c++]=j=i;j<=m;j+=i)b[j]=1;for(i=0;i<x;++i)for(j=i;j<x;++j)if((v=p[i]+p[j])<m)++r[v];else break;for(Scanner s=new Scanner(System.in);(n=s.nextInt())>0... | 142 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.