Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
B = [[a, i] for i, a in enumerate(A, 1)]
B.sort(reverse=True)
dp = [[0] * (N+1) for i in range(N+1)]
s, i = B[0]
dp[1][0] = s*(i - 1)
dp[0][1] = s*(N - i)
for n in range(2, N+1):
a, i = B[n-1]
for l in range(n+1):
r = n - l
if l == 0:
dp[l][r] = dp... | 264 |
Project_CodeNet | 2,020 | import pprint
N = int(input())
A = list(map(int, input().split()))
def student_sorting(N, A):
student_list = [0] * N
for initial_pos, activity in enumerate(A):
student_list[initial_pos] = (activity, initial_pos)
return sorted(student_list, reverse = True)
def DP(N, student_list):
DP_map = li... | 476 |
Project_CodeNet | 2,020 | from operator import itemgetter
N=int(input())
A=list(map(int, input().split()))
B=[[i, A[i]] for i in range(N)]
B=sorted(B, key=itemgetter(1), reverse=True)
dp=[[0]*(N+1) for _ in range(N+1)]
for x in range(N):
dp[x+1][0]=dp[x][0]+B[x][1]*abs(B[x][0]-x)
for y in range(N):
dp[0][y+1]=dp[0][y]+B[y][1]*ab... | 234 |
Project_CodeNet | 2,020 |
# -*- coding: utf-8 -*-
N=int(input())
As=list(map(int, input().split()))
inds=sorted(range(len(As)), key=lambda k: As[k])[::-1]
#ds=[[0 for j in range(N+1-i)] for i in range(N+1)]
ds=[0]
for xy in range(1,N+1):
i=inds[xy-1] #←
a=As[i] #←この２行でメモリアクセス省略しないとTLEになる
nds=[0]*(xy+1)
nds[-1]=ds[-1]+a*(i-(x... | 246 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.buffer.readline
n = int(input())
a = list(map(int,input().split()))
dp = [[0]*(n+1) for _ in range(n+1)]
b = []
for i in range(n):
b.append(a[i]*n + i)
b.sort(reverse = True)
for i in range(n+1):
for j in range(n+1-i):
val,idx = divmod(b[i+j-1],n)
if i > 0:
... | 204 |
Project_CodeNet | 2,020 | import sys
input=sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
ch=[]
for i in range(n):
ch.append((a[i],i))
ch.sort(reverse=True)
#print(ch)
dp=[[0]*(n+1) for _ in range(n+1)]
dp[1][1]=ch[0][0]*ch[0][1]
dp[1][0]=ch[0][0]*(n-1-ch[0][1])
for i in range(2,n+1):
for j in range(i+1):
if ... | 216 |
Project_CodeNet | 2,020 | def main():
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(key = lambda x: x[0], reverse = True)
DP = [[0] * (N + 1) for _ in range(N + 1)]
for i, b in enumerate(B):
a = b[0]
tmp = b[... | 264 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | 482 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
def solve():
N = int(rl())
A = list(map(int, rl().split()))
infants = [(ai, i) for i, ai in enumerate(A)]
infants.sort(reverse=True)
dp = [[0] * (N + 1) for _ in range(N + 1)]
ans = 0
for x in range(N):
fo... | 227 |
Project_CodeNet | 2,020 | N = int(input())
A = sorted([(a, i) for i, a in enumerate(map(int, input().split()))], reverse=True)
dp = [[0]*(N+1) for _ in [0]*(N+1)]
for j, (a, i) in enumerate(A):
for l in range(j+1):
r = N-1-(j-l)
dp[j+1][l] = max(dp[j+1][l], dp[j][l]+a*(r-i))
dp[j+1][l+1] = max(dp[j+1][l+1], dp[j][l]... | 143 |
Project_CodeNet | 2,020 | import sys
def solve():
input = sys.stdin.readline
N = int(input())
A = [int(a) for a in input().split()]
B = [(A[i], i) for i in range(N)]
B.sort(reverse = True)
DP = [[-1 for j in range(N + 1)] for _ in range(N)] #i番目の幼児まで見た時、左からi番目まで埋まっている時の最大値
DP[0][0] = B[0][0] * abs(B[0][1] - (N - 1)... | 330 |
Project_CodeNet | 2,020 | #active infants
n=int(input())
lists=list(map(int,input().split()))
data=[]
for i in range(n):
data.append((lists[i],i+1))
data=sorted(data,key=lambda x:-x[0])
#dp[K][i]=始めのKつまで考えてそのうちプラスの個数がiこの方法で最大のあたい(0<=i<=K)
#求める値はmax(dp[N][i] for i in range(N+1))で与えられる
#dp[N][N]まで考えればいい
#計算量0(N**2)
dp=[[0 for i in range(n... | 433 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
ai = [[a_, i] for i, a_ in enumerate(a)]
ai.sort(reverse=True)
# dp[i][j] 左端からi個、右端からj個を入れた場合の最適
dp = [[0]*(n+1) for _ in range(n+1)]
for i in range(n):
for j in range(n-i):
dp[i+1][j] = max(dp[i+1][j], dp[i][j] + ai[i+j][0] * (ai[i+j][1] - i))
... | 207 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.readline
n = int(input())
A = list(map(int,input().split()))
cnt = [0,n-1]
As = sorted(list(zip(A,range(n))), reverse = True)
dp = [[0]*(n+1) for _ in range(n+1)]
# 配る
for i in range(n):
for j in range(i+1):
a,p = As[i]
dp[i+1][j] = max(dp[i+1][j],dp[i][j] + a * (n-... | 163 |
Project_CodeNet | 2,020 | # from pprint import pprint
n = int(input())
a = map(int, input().split())
a = sorted(((ax, x) for x, ax in enumerate(a)), reverse=True)
dp = [[-1] * (n+1) for _ in range(n+1)]
dp[0][0] = 0
for i, (ax, x) in enumerate(a):
for j in range(i+1):
dp[j+1][i-j] = max(dp[j+1][i-j], dp[j][i-j] + ax*abs(x-j))
... | 179 |
Project_CodeNet | 2,020 | N = int(input())
_L = list(map(int,input().split()))
L = [(v,i) for i,v in enumerate(_L)]
L = sorted(L,key=lambda x:(-x[0]))
dp = [[0]*(N+1) for _ in range(N+1)]
ans=0
for x in range(N):#前から
for y in range(N):#後ろから
cur = x+y
if cur==N:
ans = max(ans,dp[x][y])
break
... | 181 |
Project_CodeNet | 2,020 | n=int(input())
a=list(map(int,input().split()))
b=[(v,s) for s,v in enumerate(a)]
b.sort(reverse=True)
dp=[[0 for i in range(n+1)] for i in range(n+1)]
for i in range(n+1):
for j in range(n+1-i):
if i+j==0:
continue
v=b[i+j-1][0]
pos=b[i+j-1][1]
if i==0:
dp[0... | 224 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
a = [(a[i], i) for i in range(n)]
a.sort(key=lambda x: -x[0])
dp = [[0 for _ in range(n+1)] for _ in range(n+1)]
for x in range(n+1):
for y in range(n+1):
if x + y > n:
break
active, idx = a[x+y-1]
if x > 0:
dp[x][... | 204 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
A=LI()
#でかいやつから左右両端のどちらかに動かす
B=sorted(zip(A,range(N)),reverse=True)
#dp[i][j]は左からi個右からj個埋まっている時... | 298 |
Project_CodeNet | 2,020 | N=int(input())
A=list(map(int,input().split()))
d={}
for i,j in enumerate(A):
d[i]=j
d=sorted(d.items(),key=lambda x:x[1],reverse=True)
dp=[[0]*(N+1) for _ in range(N+1)]
c=0
for k,v in d:
for i in range(c+1):
dp[i+1][c-i]=max(dp[i+1][c-i],dp[i][c-i]+abs(v*(k-i)))
dp[i][c-i+1]=max(dp[i][c-i... | 174 |
Project_CodeNet | 2,020 | import heapq
import math
import random
import sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, namedtuple, UserDict
from functools import cmp_to_key, lru_cache, reduce
from itertools import (chain, combinations, combinations_with_replacement,
p... | 294 |
Project_CodeNet | 2,020 | def main():
N = int(input())
A = list(map(int,input().split()))
A = [[a,i] for a,i in zip(A,range(1,N+1))]
A = sorted(A,reverse=True)
INF = float('inf')
dp = [[-INF] * (N+1) for _ in range(N+1)]
dp[0][0] = 0
ans = 0
for x_y in range(1,N+1):
a = A[x_y-1]
for x in range(x_y+1):
y = x_y-x
... | 262 |
Project_CodeNet | 2,020 | def main():
N=int(input())
A=list(map(int,input().split()))
dp=[[0 for i in range(N+1)] for _ in range(N+1)]
A_index=[i for i in range(N)]
AA=zip(A,A_index)
AA=sorted(AA,reverse=True)
A,A_index=zip(*AA)
for i in range(N):
for j in range(N-i):
score=dp[i][j]
... | 198 |
Project_CodeNet | 2,020 | n=int(input())
l=list(map(int,input().split()))
dp=[[0 for j in range(n+1)] for i in range(n+1)]
e=[]
for i in range(n):
e.append([l[i],i])
e.sort(reverse=True)
for i in range(1,n+1):
p=e[i-1][0]
q=e[i-1][1]
for j in range(i+1):
if j<i:
a1=dp[i-1][j]+p*abs(n-(i-j)-q)
else:
... | 179 |
Project_CodeNet | 2,020 | # ai の大きい方から左端か右端
# はるかに問題なのはそこから先だがDP
n=int(input())
*a,=map(int, input().split( ))
dp = [0]
#周回が総数、dpのindexが左に置いた数
aii = [(ai,i) for i,ai in enumerate(a)]
aii.sort(key= lambda x:-x[0])
for j,(ai,i) in enumerate(aii):
dp2 = [0]*(j+2)
dp2[0]=dp[0]+ai*abs(n-j-1-i)
dp2[-1]=dp[-1]+ai*abs(j-i)
for k in rang... | 227 |
Project_CodeNet | 2,020 | N = int(input())
D = []
for i, a in enumerate(map(int, input().split())):
D.append((a<<11) + i)
D.sort(reverse=True)
dp = [0]*(N+1)
for i, d in enumerate(D,start=1):
x, a = d%(1<<11),d>>11
for j in reversed(range(i)):
dp[j+1] = max(dp[j] + a*(x-j), dp[j+1])
dp[j] += a*(N-(i-j)-x)
print(max(d... | 121 |
Project_CodeNet | 2,020 | n = int(input())
A = [(a, i) for i, a in enumerate(map(int, input().split()))]
A.sort(reverse=True)
dp = [[0]*(n+1) for _ in range(n+1)]
ans = 0
for L in range(n+1):
for R in range(n+1):
if n <= L+R-1:
continue
a, i = A[L+R-1]
if 0 <= R-1:
dp[L][R] = max(dp[L][R], dp[... | 185 |
Project_CodeNet | 2,020 | def main():
N=int(input())
A=list(map(int,input().split()))
AA=[(v,i) for i,v in enumerate(A)]
AA.sort(reverse=True)
dp=[[0]*(N+1) for _ in range(N+1)]
for len in range(1,N+1):
val,index=AA[len-1]
for x in range(0,len+1):
y=len-x
if x==0:
d... | 208 |
Project_CodeNet | 2,020 | import heapq
import time
st = time.time()
n = int(input())
a = list(map(int,input().split()))
hq = []
for i, ai in enumerate(a):
heapq.heappush(hq,(-ai,i))
dp = [[0 for i in range(j+1)] for j in range(n+1)]
dp[0][0] = 0
ai,hi = heapq.heappop(hq)
dp[1][0] = -ai*(n-1-hi)
dp[1][1] = -ai*hi
for i in range(2,n+1):
a... | 244 |
Project_CodeNet | 2,020 | import copy
n = int(input())
a = list(map(int, input().split()))
array = [(a[i], i+1) for i in range(n)]
array.sort(reverse=True)
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:
break
count = i + j
#右に移した場合
value, in... | 214 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.readline
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(1, N+1):
a, k = A[i-1]
dp[i][0] = dp[i-1][0] + a * abs(N-i-k)
for j in range(1, i):
dp[i][j] = max(dp[i-1][j] + ... | 180 |
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)
# print(babies)
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
active, i... | 178 |
Project_CodeNet | 2,020 | n=int(input())
a=list(map(int,input().split()))
cost=[]
for i,g in enumerate(a):
cost.append([g,i])
cost.sort(reverse=True)
dp=[[0] *(n+1) for _ in range(n+1) ]
for i in range(n):
for j in range(i+1):
dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]+cost[i][0]*abs(cost[i][1]-j))
dp[i+1][j]=max(dp[i+1][j... | 149 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(10**6)
N = int(input())
A = list(map(int, input().split()))
acts = [(x, i) for i, x in enumerate(A)]
acts.sort()
dp = [[-1]*N for _ in range(N)]
def solve(l, r):
if r < l:
return 0
if dp[l][r] >= 0:
return dp[l][r]
k = r - l
act, init_pos = acts[k]
... | 180 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.readline
N = int(input())
a = list(map(int, input().split()))
sa = [(a[i], i) for i in range(N)]
sa.sort(key = lambda x: (-x[0], -abs(x[1] - (N - 1) / 2)))
dp = [[0] * (N + 1) for _ in range(N + 1)]
for k in range(N):
x, i = sa[k]
for l in range(k + 1):
r = k - l
nr = N - 1 - r
... | 227 |
Project_CodeNet | 2,020 | import sys
# def input(): return sys.stdin.readline().rstrip()
# input = sys.stdin.readline
input = sys.stdin.buffer.readline
N = int(input())
A = sorted(zip(map(int, (input().split())) ,range(N)), reverse=True)
dp = [[0]*(N+1) for _ in range(N+1)]
ans = 0
for i in range(N):
for j in range(i+1):
dp[i+1][j... | 196 |
Project_CodeNet | 2,020 | n=int(input())
a=list(map(int,input().split()))
l=[]
for i,x in enumerate(a):
l.append([x,i])
l.sort(reverse=True)
cnt=1
dp=[[0]*(n+1) for _ in range(n+1)]
for i,j in l:
for x in range(cnt+1):
if x==0:
dp[x][cnt-x]=dp[x][cnt-x-1]+i*(n-1-(cnt-x-1)-j)
elif x==cnt:
dp[x][cnt... | 208 |
Project_CodeNet | 2,020 | N, = map(int, input().split())
X = [(i+1, x) for i, x in enumerate(map(int, input().split()))]
dp = [[0]*(N+1) for _ in range(N+1)]
X = sorted(X, key=lambda x:x[1])[::-1]
for i in range(1, N+1):
ai, a = X[i-1]
dp[i][0] = dp[i-1][0]+a*abs(ai-(N-i+1))
for j in range(1, i):
dp[i][j] = max(dp[i-1][j-1]+... | 190 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(2 * 10 ** 5)
N = int(input())
A = [int(x) for x in input().split()]
A = sorted((a, i) for i, a in enumerate(A))
cache = [[None for i in range(N + 1)] for j in range(N + 1)]
def dp(l, r):
if l > r:
return 0
if cache[l][r] is None:
a, x = A[r - l]
cac... | 168 |
Project_CodeNet | 2,020 | N=int(input())
*A,=map(int, input().split())
B=[(i+1,a) for i,a in enumerate(A)]
from operator import itemgetter
B.sort(reverse=True, key=itemgetter(1))
dp = [[-1] * (N+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
idx, act = B[i-1]
for j in range(i+1):
k = i-j
if 0<j: dp[j][k] = ... | 206 |
Project_CodeNet | 2,020 | from bisect import bisect_left
N = int(input())
As = [(x, i) for i, x in enumerate(map(int, input().split()))]
up = sorted(As)
dp = [[0]*(N+1) for _ in range(N+1)]
for i, (u, idx) in enumerate(up[::-1], 1):
for j in range(i):
left = j
right = N-(i-j)
dp[i][j] = max(dp[i][j], dp[i-1][j]+u*a... | 158 |
Project_CodeNet | 2,020 | N = int(input())
A = sorted([(int(a), i) for i, a in enumerate(input().split())], key = lambda x: x[0])[::-1]
X = [0] + [-1<<100] * (N + 5)
for k, (a, i) in enumerate(A):
X = [max(X[j] + abs(N - (k - j) - 1 - i) * a, X[j-1] + abs(j - 1- i) * a if j else 0) for j in range(N + 5)]
print(max(X)) | 128 |
Project_CodeNet | 2,020 | import itertools
n = int(input())
l = list(map(int,input().split()))
li = [i for i in range(n)]
a = []
for i in range(n):
a.append([l[i],i])
a.sort(reverse = True)
dp = [[-1]*(n+1) for i in range(n+1)]
dp[0][0] = 0
for i in range(n):
for j in range(i+1):
le = j
ri = i-le
dp[le+1][ri] =... | 217 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int,input().split()))
b = []
for i in range(n):
b.append([a[i],i])
b.sort(reverse=True)
now = [0]
for i in range(n):
aj,j = b[i]
last = now
now = []
for l in range(i+1):
r = l+n-1-i
now.append(last[l]+aj*abs(r-j))
#print(aj,j,l,r,abs(r-j))
#print(now,'#',aj,j)
for... | 167 |
Project_CodeNet | 2,020 | n = int(input())
A = list(map(int,input().split()))
A = sorted([(a,i) for i,a in enumerate(A)],reverse=True)
dp=[[0]*(n+1) for i in range(n+1)]
# i+j=n
for i in range(n):
for j in range(n-i):
a,k=A[i+j]
dp[i+1][j]=max(dp[i+1][j], dp[i][j]+abs(k-i)*a)
dp[i][j+1]=max(dp[i][j+1], dp[i][j]+abs(... | 155 |
Project_CodeNet | 2,020 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
A = list(map(int,readline().split()))
A = [(A[i], i) for i in range(N)]
A_sort = sorted(A,reverse = True)
dp = [-float('inf')]*(N+1)
dp[0] = 0
for i in range(N):
dp_new = [-flo... | 225 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.buffer.readline
def main():
n = int(input())
A = list(map(int, input().split()))
L = [(a, i+1) for i, a in enumerate(A)]
L.sort(reverse=True)
dp = [[-1]*(n+1) for _ in range(n+1)]
dp[0][0] = 0
ans = 0
for i in range(n+1):
for j in range(n+1-i):
a, idx = L[i+j-1]
... | 215 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.readline
N=int(input())
A=list(map(int,input().split()))
A2=[(num,ind) for ind,num in enumerate(A)]
A2.sort(reverse=True)
L=[0]*N
for i in range(N):
num,ind=A2[i]
NL=[0]*N
for j in range(i+1):
right=N-1-(i-j)
NL[j]=max(NL[j],abs(right-ind)*num+L[j])
... | 144 |
Project_CodeNet | 2,020 | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
from collections import defaultdict
def resolve():
N = ir()
A = sorted([[i+1, d] for i, d in enumerate(lr())], key=lambda x: x[1])[::-1]
dp = defaultdict(lambda: -float('inf'))
dp[0, 0]... | 213 |
Project_CodeNet | 2,020 | n = int(input())
A_l = [(A,i) for i, A in enumerate(map(int,input().split()))]
A_l.sort(reverse=True)
dp = []
for _ in range(n+1):
dp.append([0] * (n+1))
for j in range(1,n+1): # all go bigger
a, i = A_l[j-1]
dp[j][0] = dp[j-1][0] + a*(n-(j-1) - (i+1))
for k in range(1,n+1): # all go smaller
a, i = A_l... | 313 |
Project_CodeNet | 2,020 | n = int(input())
buf = list(map(int,input().split()))
a = []
for i in range(n):
a.append([buf[i],i])
a = sorted(a,reverse=True)
dp = [[0]*(n+1) for i in range(n+1)]
for i in range(n):
for j in range(n-i):
cur = i+j
temp1 = dp[i][j]+a[cur][0]*abs(n-1-a[cur][1]-j)
temp2 = dp[i][j]+a[cur][... | 175 |
Project_CodeNet | 2,020 | def solve():
N = int(input())
A = [(a, i+1) for i, a in enumerate(map(int, input().split()))]
A.sort(reverse=True)
INF = float('inf')
dp = [[-INF] * (N+1) for _ in range(N+1)]
dp[0][0] = 0
for s in range(1, N+1):
for l in range(s+1):
r = s - l
dp[l]... | 208 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
def main():
# 整数の入力
a = int(input())
# # スペース区切りの整数の入力
nums = list(map(int, input().split()))
vilist = []
for i in range(a):
vilist.append((nums[i], i))
vilist = sorted(vilist, key=lambda vi: vi[0])
# dp[x][y]をx人を左から活性度順に並べて、y人を右から活性度順に並べた状態のスコア最大値とする... | 628 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n = int(input())
A = list(map(int,input().split()))
AI = [(a, i) for i, a in enumerate(A)]
AI.sort(reverse = 1)
dp = [[0] * (n + 1) for _ in range(n + 1)]
... | 232 |
Project_CodeNet | 2,020 | N = int(input())
S = list(map(int, input().split()))
data = [0]*N
for i, item in enumerate(S):
data[i] = [item, i]
data.sort(reverse=True)
dp = [[0]*(N+1) for _ in range(N+1)]
# dp[i][j] i+j-1番目までの幼児がi人0から、j人N-1から並んだ時の最大値
for i in range(N):
for j in range(N):
if i+j >= N:
break
dp... | 232 |
Project_CodeNet | 2,020 | n = int(input())
a = [(_a, i) for i, _a in enumerate(map(int, input().split()))]
a.sort(reverse=True)
dp = [[0]*(n+1) for _ in range(n+1)]
for i, (v, p) in enumerate(a):
# 前にj人いる
dp[i+1][0] = dp[i][0] + v*abs((n-1 - i) - p)
for j in range(1, i+1):
dp[i+1][j] = max(dp[i][j] + v*abs((n-1 - (i-j)) - p... | 193 |
Project_CodeNet | 2,020 | # coding: utf-8
N = int(input())
_A = sorted(enumerate(map(int, input().split()), 1), key=lambda x:x[1], reverse=True)
dp = [[0] * (N+1) for i in range(N+1)]
for i in range(1,N+1):
k, Ak = _A[i-1]
if (N-i-k) < 0:break
dp[0][i] = dp[0][i-1] + (N-i+1-k) * Ak
for i in range(1,N+1):
k, Ak = _A[i-1]
if... | 265 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
D = [(A[i], i) for i in range(N)]
D.sort(reverse=True)
dp = [[0 for j in range(N + 1)] for i in range(N + 1)]
for j in range(1, N + 1):
dp[0][j] = dp[0][j - 1] + D[j - 1][0] * abs(D[j - 1][1] - (N - j))
for i in range(1, N + 1):
dp[i][0] = dp[i - 1][0] + ... | 328 |
Project_CodeNet | 2,020 | N = int(input())
A = enumerate(map(int,input().split()))
A = sorted(A,reverse=True,key=lambda x:x[1])
DP = [[0] * (N+1) for x in range(N+1)]
for i in range(1,N+1):
b,a = A[i-1]
b += 1
for j in range(i+1):
c = 0
if i >= 1 and j >= 1:
dst = j
c = max(c,DP[i-1][j-1]+a*... | 181 |
Project_CodeNet | 2,020 | def examA():
R = I()
ans = R*2*3.141592
print(ans)
return
def examB():
N, M = LI()
A = LI()
S = sum(A)
if N>=S:
ans = N-S
else:
ans = -1
print(ans)
return
def examC():
N = I()
A = LI()
ans = [0]*N
for i in range(N-2,-1,-1):
ans[A[i]-1... | 752 |
Project_CodeNet | 2,020 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
N = int(input())
A = [(i, v) for i, v in enumerate(map(int, input().split()))]
values = [[0] * (N + 1) for _ in range(N + 1)]
A.sort(key=lambda x:-x[1])
for i, (p, v) in enumerate(A):
for j in range(i + 1):
left = abs((p - j) * v)
r... | 214 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
A = sorted([(a, i) for i, a in enumerate(A)], reverse=True)
dp = [0] * (N + 1)
for i in range(N):
dp2 = dp[:]
for l in range(i + 1):
a, pos = A[i]
# add left side
dp2[l + 1] = max(dp2[l + 1], dp[l] + abs(pos - l) * a)
# add ri... | 162 |
Project_CodeNet | 2,020 | def main():
N = int(input())
A = list(map(int, input().split()))
AA = [(v, i) for i, v in enumerate(A)]
AA.sort(reverse=True)
dp = [[0] * (N+1) for _ in range(N+1)]
for i, (a, b) in enumerate(AA, start=1):
for x in range(i+1):
y = i - x
if y == 0:
... | 238 |
Project_CodeNet | 2,020 | def numba_compile(numba_config):
import os, sys
if sys.argv[-1] == "ONLINE_JUDGE":
from numba import njit
from numba.pycc import CC
cc = CC("my_module")
for func, signature in numba_config:
globals()[func.__name__] = njit(signature)(func)
cc.export(func.__... | 448 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
p = list(range(n))
p.sort(key=lambda i: a[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)),dp[j + 1] + a[p[i]] * abs(p[i] - j))
print(dp[0])
| 107 |
Project_CodeNet | 2,020 | #import numpy as np
#import math
#from decimal import *
#from numba import njit
#@njit
def main():
N = int(input())
A = list(map(int, input().split()))
A = sorted(enumerate(A), key = lambda x: x[1])[::-1]
#dp = np.zeros((N+1,N+1), dtype='int64')
dp = [[0]*(N+1-i) for i in range(N+1)]
m = 0
... | 315 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
A = [[a,i] for a,i in zip(A,range(N))]
A = sorted(A,reverse=True)
dp = [[0]*(N+1) for _ in range(N+1)]
ans = 0
for n in range(0,N+1):
for y in range(0,n+1):
x = n-y
a = A[n-1]
ind = a[1]
if x==0 and y==0:
dp[x][y] = 0... | 258 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.readline
n = int(input())
a = [int(i) for i in input().split()]
b = [int(i) for i in range(n)]
ab = [(x,y) for x,y in zip(a,b)]
from operator import itemgetter
ab = tuple(sorted(ab,key=itemgetter(0),reverse=True))
dp = [[-10**14]*(n+1) for i in range(n+1)]
dp[0][0] = 0
for i in range(n):
... | 178 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
A = sorted([(a, p) for p, a in enumerate(A)], reverse=True)
# dp[i][j] := i番目の幼児まで見て、左に詰める選択をj回行った場合のうれしさの最大値
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 ... | 238 |
Project_CodeNet | 2,020 | n = int(input())
a = sorted([(v, i) for i, v in enumerate(list(map(int, input().split())))])[::-1]
dp = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
ans = 0
for i in range(n):
for j in range(n - i):
v, p = a[i + j]
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j] + v * abs(n - 1 - i - p))
dp... | 177 |
Project_CodeNet | 2,020 | def main():
from random import sample
from operator import itemgetter
e=enumerate
n,a=open(0)
n=int(n)
d=[0]+[-2**64]*n
for j,(a,i)in e(sorted(sample([(a,i)for i,a in e(map(int,a.split()))],n),key=itemgetter(0),reverse=1)):
d=[max(t+a*(~i-j+k+n),d[k-1]+a*abs(~i+k))for k,t in e(d)]
... | 122 |
Project_CodeNet | 2,020 | (N,) = map(int, input().split())
As = list(enumerate(map(int, input().split())))
As.sort(key=lambda x: -x[1])
dp = [[0] * (N + 1) for _ in range(N + 1)]
for i, (pos, val) in enumerate(As):
for j in range(i + 1):
k = i - j
dp[j + 1][k] = max(dp[j + 1][k], dp[j][k] + abs(j - pos) * val)
dp[j][... | 173 |
Project_CodeNet | 2,020 | import sys
import socket
hostnames = ['N551J', 'F551C', 'X553M']
input_file = 'e1.in'
if socket.gethostname() in hostnames:
sys.stdin = open(input_file)
def read_int_list():
return list(map(int, input().split()))
def read_int():
return int(input())
def read_str_list():
return input().split()
de... | 421 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int,input().split()))
num = []
for i in range(n):
num.append([a[i],i])
num.sort(reverse = True)
dp = [[0]*(n+1)for i 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
dp[l+1][r] = max(dp[... | 176 |
Project_CodeNet | 2,020 | N=int(input());A=sorted((int(x),i)for i,x in enumerate(input().split()));t=[0]*N**2
for w in range(N):
a,j=A[w]
for l in range(N-w):
r=l+w;p=a*abs(j-l);t[l*N+r]=max(p+t[(l+1)*N+r],a*abs(j-r)+t[l*N+r-1])if w else p
print(t[N-1]) | 99 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
def main():
N=int(input())
A=list(map(i... | 280 |
Project_CodeNet | 2,020 | N = int(input())
A = [int(i) for i in input().split()]
ap = [(v, k) for k, v in enumerate(A)]
ap.sort(reverse=True)
dp = [[-float('inf')] * (N + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i, (a, p) in enumerate(ap) :
for l in range(i + 1) :
r = i - l
if l + 1 <= N :
dp[l + 1][r] = max(dp[l + 1][r], d... | 209 |
Project_CodeNet | 2,020 | n = int(input())
al = list(map(int, input().split()))
a_val_ind_l = []
for i, a in enumerate(al):
a_val_ind_l.append((a,i))
a_val_ind_l.sort(reverse=True)
dp = [[0]*(n+1) for _ in range(n+1)]
for i in range(n):
for j in range(0,n-i):
dp[i+1][j] = max(dp[i][j] + a_val_ind_l[i+j][0] * abs(a_val_ind_l[... | 203 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(10 ** 9)
input()
arr = list(sorted([(v, idx) for idx, v in enumerate(map(int, input().split()))], reverse=True))
d = [[-1 for _ in range(len(arr))] for _ in range(len(arr))]
def dp(l, r, idx):
if idx == len(arr):
return 0
if d[l][r] != -1:
return d[l][r]
... | 198 |
Project_CodeNet | 2,020 | # 解説AC
import sys
input = sys.stdin.buffer.readline
n = int(input())
A = list(map(int, input().split()))
B = []
for i, e in enumerate(A):
B.append((e, i + 1))
B.sort(reverse=True)
# dp[i][j]: Aiまで入れた時、左にj個決めた時の最大値
dp = [[-1] * (n + 1) for _ in range(n + 1)]
dp[0][0] = 0
for i in range(n):
for j in range(i + 1... | 274 |
Project_CodeNet | 2,020 | def main():
N = int(input())
A = list(map(int, input().split()))
dp = [[0] * (N+1-i) for i in range(N+1)]
A = list(enumerate(A))
A.sort(key=lambda x: x[1])
ans = 0
for z in range(1, N+1):
tmp = A.pop()
i = tmp[0]+1
a = tmp[1]
for x in range(z+1):
... | 258 |
Project_CodeNet | 2,020 | def main():
# import sys
# readline = sys.stdin.readline
# readlines = sys.stdin.readlines
N = int(input())
A = [(a, i) for i, a in enumerate(map(int, input().split()))]
A.sort(reverse=True)
dp = [[-float('inf')] * (N + 1) for _ in range(N + 1)]
dp[0][0] = 0
for k in range(N):
... | 254 |
Project_CodeNet | 2,020 | MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
def main():
n = int(input())
a = list(enumerate(map(int,input().split())))
a.sort(key = lambda x:x[1],reverse = True)
dp = [[0] * (n + 1) for _ in range(1 + n)]
for i in range(n ... | 276 |
Project_CodeNet | 2,020 | n=int(input())
a=map(int,input().split())
b = [ (a,i) for i,a in enumerate(a)]
b.sort(reverse=True)
dp=[ [0] * (n+1) for i 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
act , i = b[l+r]
dp[l+1][r] = max( dp[l+1][r] , dp[l][r] +... | 169 |
Project_CodeNet | 2,020 | n = int(input())
l = list(map(int, input().split()))
INF = 10 ** 16
dp = [-INF] * (n + 1)
dp[0] = 0
import heapq
q = []
for i in range(n):
heapq.heappush(q, (-l[i], i))
for itera in range(n):
_, ind = heapq.heappop(q)
val = l[ind]
dpnew = [-INF] * (n + 1)
for i in range(n):
left = dp[i]... | 199 |
Project_CodeNet | 2,020 | mod = 1000000007
eps = 10**-9
inf = 10**15
def main():
import sys
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
AA = []
for i, a in enumerate(A):
AA.append((a, i))
AA.sort(key=lambda x: x[0], reverse=True)
dp = [[-inf] * (N+1) for _ in range... | 258 |
Project_CodeNet | 2,020 | N = int(input())
A = sorted([(i, int(a)) for i, a in enumerate(input().split())], key=lambda x: x[1])[::-1]
dp = [[0] * (N+1) for _ in range(N+1)] # 先頭からi+j人使ったときに(左にi人, 右にj人) => 最大の嬉しさ
cnt = 0
for k, a in A:
for i in range(N):
j = cnt - i
if j < 0:
continue
# 左に移動
dp[i ... | 255 |
Project_CodeNet | 2,020 | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
import sys,bisect,string,math,time,functools,random
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().split()
def... | 1,557 |
Project_CodeNet | 2,020 | def main():
N = int(input())
INF = float('inf')
A = [(i+1, a) for i, a in enumerate(map(int, input().split()))]
A = sorted(A, key=lambda x: x[1], reverse = True)
dp = [[-INF] * (N+1) for _ in range(N+1)]
dp[0][0] = 0
for s in range(1, N+1):
for l in range(s+1):
r = s - l
dp[l][r] = max(d... | 221 |
Project_CodeNet | 2,020 | # 解説AC
N = int(input())
A = map(int, input().split())
children = [(a, i) for i, a in enumerate(A)]
children.sort(reverse=True)
# dp[i][j]: うれしさの合計の最大値
# i: 左端の個数
# j: 右端の個数
dp = [[0] * (N + 1) for _ in range(N + 1)]
ans = 0
# 配るDP
for l in range(N):
for r in range(N):
if l + r == N:
ans = ma... | 237 |
Project_CodeNet | 2,020 | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n = int(input())
a = list(map(int, readline().split()))
dp = [[0] * (n + 1) for _ in range(n + 1)]
for i in range(n):
val = max(a)
idx = a.index(val)
a[id... | 241 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
# dp[n][k]: nは現在使っている個数、kは左から詰めた個数
dp = [[0 for _ in range(N + 1)] for _ in range(N + 1)]
p = [(a, i) for i, a in enumerate(A)]
p.sort(reverse=True)
for i in range(N):
pi = p[i][1]
for l in range(i + 1):
# add to left
dp[i + 1][l + 1] = ma... | 218 |
Project_CodeNet | 2,020 | def i1str():
return input()
def istrs(n=None):
if n is None:
return input().split()
a = []
for _ in range(n):
a.append(istrs())
return a
def i1num():
return int(input())
def inums(n=None):
if n is None:
return list(map(int, input().split()))
a = []
for _... | 350 |
Project_CodeNet | 2,020 | from sys import stdin
def get_result(data):
N = data[0][0]
A = data[1]
dp = [[0]*(N+1) for _ in range(N+1)]
B = [[A[i], i] for i in range(N)]
B = sorted(B, reverse=True)
for i in range(N):
for j in range(N-i):
dp[i+1][j] = max(dp[i+1][j], dp[i][j] + B[i+j][0] * (B[i+j][1] -... | 247 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(10**9)
mod = 1000000007
INF = 110110110
N = int(input())
A = list(map(int, input().split()))
PA = []
for i in range(N):
PA.append((A[i], i))
PA.sort(reverse=True)
dp = [[0 for j in range(N+1)] for i in range(N+1)]
for i in range(N+1):
for j in range(N+1):
dp[i][j] = ... | 266 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
p = list(range(N))
p.sort(key=lambda i: A[i], reverse=True)
dp = [[0]*(N + 1) for _ in range(N + 1)]
for i in range(N):
for j in range(i + 1):
pi = p[i]
dp[i+1][j] = max(dp[i+1][j], dp[i][j] + A[pi]*(N - i + j - 1 - pi))
dp[i+1][j+1] = d... | 142 |
Project_CodeNet | 2,020 | N = int(input())
A = [int(i) for i in input().split(' ')]
AA = []
for i,a in enumerate(A):
AA.append(tuple([a,i]))
AA = sorted(AA,reverse=True)
DP =[]
for _ in range(N+1):
DP.append([0]*(N+1))
for i,a in enumerate(AA):
for x in range(i+1):
y = i - x
if x+ 1 <= N:
DP[x+1][y] = ... | 214 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
p = sorted([(x, i) for i, x in enumerate(a)], reverse=True)
dp = [[0 for _ in range(n+1)] for _ in range(n+1)]
for s in range(1, n+1):
for x in range(s+1):
y = s-x
if x > 0:
dp[x][y] = max(dp[x][y], dp[x-1][y] + abs(p[s-1][1] - x + 1) * p[s-1][0])
if y > 0:... | 192 |
Project_CodeNet | 2,020 | import sys
import math
from collections import deque
import heapq
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()
N = I()
a = IL()
b... | 298 |
Project_CodeNet | 2,020 | import sys
import numpy as np
sys.setrecursionlimit(10 ** 9)
#def input():
# return sys.stdin.readline()[:-1]
N = int(input())
#X, Y = map(int,input().split())
A = list(map(int,input().split()))
B = []
for i in range(N):
B.append([A[i], i])
B.sort(reverse=True)
#dp = [[0 for _ in range(N+2)] for _ in range(N... | 351 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.