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 = map(int, input().split())
babies = [(a, i) for i, a in enumerate(a)]
babies.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
activeness, ind = babies... | 176 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
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[... | 249 |
Project_CodeNet | 2,020 | N = int(input())
As = list(map(int, input().split()))
arridx = [(i, a) for i, a in enumerate(As)]
arridx.sort(key=lambda x: x[1])
dp = {}
dp[(0, N-1)] = 0
for i in range(N-1, -1, -1):
ndp = {}
for l in range(N-i+1):
r = l + i - 1
idx, a = arridx[i]
lsc = rsc = 0
if l > 0:
... | 222 |
Project_CodeNet | 2,020 | n = int(input())
a = [(int(j), i) for i, j in enumerate(input().split())]
a.sort(reverse=1)
dp = [[0] * (n+1) for _ in range(n + 1)]
for i in range(1, n + 1):
for j in range(i + 1):
k = i - j
if j != 0:
dp[i][j] = dp[i - 1][j - 1] + a[i-1][0] * (abs(j - 1 - a[i-1][1]))
if k != 0... | 183 |
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... | 223 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int,input().split()))
a = [(num,i) for i,num in enumerate(a)]
a.sort(reverse=True)
dp=[[0]*(n+1) for _ in range(n+1)]
for i in range(n+1):
for j in range(n-i+1):
if i>0:
dp[i][j] = max(dp[i][j],dp[i-1][j]+a[i+j-1][0]*abs(a[i+j-1][1]-(i-1)))
if j>0:
... | 181 |
Project_CodeNet | 2,020 | n=int(input())
a=map(int,input().split())
p=[(x,i) for i,x in enumerate(a)]
p.sort(reverse=True)
ans=0
dp=[[0]*(n+1) for i in range(n+1)]
for i in range(n+1):
for j in range(n+1):
if i+j==n:
ans=max(ans,dp[i][j])
break
act,ind=p[i+j]
dp[i+1][j]=max(dp[i+1][j],
dp[i][j]+act*... | 157 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
A = sorted([(val, pos) for pos, val in enumerate(A)], reverse=True)
dp = [0]
for i, (val, pos) in enumerate(A):
ldp = [e + val * abs(pos - (i - r)) for r, e in enumerate(dp)]
rdp = [e + val * abs(N - 1 - r - pos) for r, e in enumerate(dp)]
dp = [max(L, ... | 135 |
Project_CodeNet | 2,020 | from sys import setrecursionlimit, exit
setrecursionlimit(1000000000)
def main():
n = int(input())
a = [(int(v), i) for i, v in enumerate(input().split())]
a.sort(reverse=True)
dp = [[0] * (n + 1) for _ in range(n + 1)]
dp[0][0] = a[0][0] * (n - 1 - a[0][1])
dp[0][1] = a[0][0] * a[0][1]
for... | 322 |
Project_CodeNet | 2,020 | n=int(input())
l=sorted([(v,i+1) for i,v in enumerate(list(map(int,input().split())))],reverse=1)
dp=[[0]*(n+1) for i in range(n+1)]
for ko in range(1,n+1):
for x in range(ko+1):
ret=0
v,i=l[ko-1]
y=ko-x
if y>=1:ret=max(ret,dp[x][y-1]+abs(n-y+1-i)*v)
if x>=1:ret=max(ret,dp[x-... | 159 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
n = int(input())
a = [int(item) for item in input().split()]
aind = []
for i, item in enumerate(a):
aind.append((item, i))
aind.sort(reverse=True)
# dp[i-th item][put j item left] : max value
dp = [[-1] * (n + 1) for _ in range(n + 1)]
dp[0][0] = 0
for... | 234 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... | 539 |
Project_CodeNet | 2,020 | n=int(input())
a_=list(map(int,input().split()))
a=[[i+1,ai] for i,ai in enumerate(a_)]
a.sort(key=lambda x:x[1],reverse=True)
dp=[[0]*(n+1) for _ in range(n+1)]
# dp[i][j]:大きい順にi+j人のうち、i人を左に、j人を右に移した時の最大値。
dp[1][0]=a[0][1]*abs(a[0][0]-1)
dp[0][1]=a[0][1]*abs(a[0][0]-n)
for k in range(2,n+1):
for i in range(k+1):
... | 333 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.readline
from collections import deque
N = int(input())
#A = list(map(int, input().split()))
A = [(a, i) for i, a in enumerate(map(int, input().split()))]
A = sorted(A, reverse=True)
values = []
num_indcies = {}
for i, a in enumerate(A):
if not a in num_indcies:
num_indcies[a]... | 308 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
a2 = [(a[i], i) for i in range(n)]
a2.sort(reverse=True)
# print(a2)
dp = [[0] * (n + 1) for _ in range(n + 1)]
for i, (aj, j) in enumerate(a2):
for k in range(i + 1):
# left
dp[i + 1][k + 1] = max(dp[i][k] + aj * abs(k - j), dp[i + 1][k + 1])
... | 191 |
Project_CodeNet | 2,020 | n = int(input())
al = list(map(int, input().split()))
l = 0
r = n-1
data = [[i, a] for i, a in enumerate(al)]
data.sort(key=lambda x: x[1], reverse=True)
dp = [[0]*(n+1) for _ in range(n+1)]
for i in range(n):
for j in range(0, i+1):
p, a = data[i]
dp[i+1][j+1] = max(dp[i+1][j+1], dp[i][j] + abs(n-... | 169 |
Project_CodeNet | 2,020 | def main():
N, *A = map(int, open(0).read().split())
A = sorted(enumerate(A), reverse=True, key=lambda x: x[1])
dp = [[0] * r for r in reversed(range(1, N + 2))]
for l in range(N):
for r in range(N - l):
p, a = A[l + r]
dp[l + 1][r] = max(
dp[l + 1][r],... | 183 |
Project_CodeNet | 2,020 | from collections import defaultdict
n = int(input())
a = list(map(int,input().split()))
infants = []
for i in range(n):
infants.append((a[i],i))
infants.sort()
dp = [defaultdict(int) for _ in range(n+1)]
dp[0][0] = 0
for i in range(n):
score,initial = infants.pop()
for right in dp[i].keys():
dp[i+1]... | 164 |
Project_CodeNet | 2,020 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf
import math
#from sortedcontainers import SortedList, SortedDict, SortedSet # no in atcoder
import bisect
class Solver:
def __init__(self, n, students):
... | 504 |
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 = [[0]*(i+1) for i in range(N+1)]
for z in range(N):
for y in range(z+1):
dp[z+1][y] = max(A[z][0]*(A[z][1]-(z-y))+dp[z][y],dp[z+1][y])
dp[z+1][y+1]= A[z][0]*((N-y-1)-A[z][1])+dp[z][y]... | 139 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int,input().split()))
# 移動先xi
# p[i] = a[i]*|i-xi|
# if i > xi:ans = sum(p[i]) = sum(a[i]*(i-xi)) -> a[i]の大きい順にxiを小さくする
# if i < xi:ans = sum(p[i]) = sum(a[i]*(xi-i)) -> a[i]の小さい順にxiを小さくする
# dp[i][j]:i人がi-xi（左にいく）,j人がxi-i（右にいく）で計算（i*xi = j*xi)
A=[]
for i in range(n):
A.append((a[i],i... | 321 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int,(input().split())))
B = [(0)*2 for _ in range(N)]
for i in range(N):
B[i] = (A[i],i)
B.sort(reverse=True)
dp = [[0]*(N+1) for _ in range(N+1)]
dp[0][0] = 0
ans = []
for l in range(N+1):
for r in range(N+1):
if l+r == N:
ans.append(dp[l][r])
bre... | 224 |
Project_CodeNet | 2,020 | def solve(n, aaa):
dp = [0]
aaa_with_idx = list(zip(aaa, range(n)))
aaa_with_idx.sort(reverse=True)
for k in range(1, n + 1):
ndp = [0] * (k + 1)
a, i = aaa_with_idx[k - 1]
for l in range(k):
# 左に配置
ndp[l + 1] = max(ndp[l + 1], dp[l] + a * abs(i - l))
... | 187 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
from collections import deque
from fractions import gcd
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9+7
INF = float('inf')
#############
# Functions #
######... | 942 |
Project_CodeNet | 2,020 |
def resolve():
N = int(input())
A = list(map(int, input().split()))
A = sorted([(a, i) for i, 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):
... | 261 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
D = [[0] * 2 for _ in range(N)]
for i in range(N):
D[i] = [i, A[i]]
D.sort(key = lambda x: x[1], reverse = True)
DP = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(N):
n, x = D[i]
t = i + 1
for j in range(t + 1):
l = j
r = t - j
rr = N ... | 241 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int,input().split()))
A = [[A[i],i] for i in range(N)]
A.sort()
dp = [[0]*(N+1) for i in range(N+1)]
ans = 0
for i in range(N+1):
for j in range(N+1):
if i+j>N:
continue
if i+j==0:
continue
a,k = A[-i-j]
if i==0:
dp... | 203 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
l = sorted(zip(a, range(0, n)), reverse=True)
p = [0] * n
for i in range(n):
p[i] = l[i][1]
a.sort(reverse=True)
dp = [[0] * (n + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
for j in range(i + 1):
k = i - j
if j == 0:
dp[j]... | 286 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
b = []
for i, v in enumerate(a):
b.append([v, i])
b.sort(reverse = True)
dp = [[0] * (n+1) for _ in range(n+1)]
ans = 0
for i in range(n+1):
for j in range(n+1-i):
if i > 0:
dp[i][j] = max(dp[i][j], dp[i-1][j] + b[i+j-1][0] * (b[i+j-1][1]... | 209 |
Project_CodeNet | 2,020 | #E
N = int(input())
A = list(map(int,input().split()))
B = []
for i in range(N):
B.append([A[i],i+1])
B.sort(reverse=True)
DP = [[0 for _ in range(N+1)] for _ in range(N+1)] #dp[x][y] x->1,2,3... y->N,N-1,N-2...
for i in range(N):
I = i+1
b,ind = B[i]
for j in range(I+1):
if j == 0:
... | 265 |
Project_CodeNet | 2,020 | n=int(input())
a=list(map(int,input().split()))
b=[(a[i],i)for i in range(n)]
b.sort(reverse=1)
dp=[(n+1)*[0]for _ in range(n+1)]
for i in range(1,n+1):
p,j=b[i-1]
if j<i-1:break
dp[i][0]+=dp[i-1][0]+p*(j-(i-1))
for i in range(1,n+1):
p,j=b[i-1]
if j>(n-i):break
dp[0][i]+=dp[0][i-1]+p*((n-i)-j)
for i in ran... | 275 |
Project_CodeNet | 2,020 | import sys
from pprint import pprint
readline = sys.stdin.readline
N = int(readline())
A = list(map(int, readline().split()))
inds = [v[1] for v in sorted([(a, i) for i, a in enumerate(A)], reverse=True)]
dp = [[0] * (N+1) for i in range(N+1)]
dp[0][0] = 0
for y in range(N + 1):
for x in range(N - y + 1):
... | 283 |
Project_CodeNet | 2,020 | import sys
readline = sys.stdin.readline
N = int(readline())
A = list(map(int, readline().split()))
L = list(range(N))
L.sort(key = lambda x: A[x], reverse = True)
dp = [[0]*(N+1) for _ in range(N+1)]
for s in range(N):
l = L[s]
a = A[l]
for i in range(s+1):
j = s-i
dp[i+1][j] = max(dp[i+... | 185 |
Project_CodeNet | 2,020 | from sys import stdin, stdout
import math
import bisect
import datetime
n = int(stdin.readline().strip())
arr = list(map(int, stdin.readline().strip().split()))
arr.insert(0,0)
d={}
for i in range(len(arr)):
d[i] = arr[i]
arr = sorted(d.items(), key=lambda a: a[1])
dp = [[0 for i in range(2005)] for j in range(20... | 228 |
Project_CodeNet | 2,020 | # E - Active Infants
N = int(input())
A = list(map(int,input().split()))
dp = [[] for _ in range(N+1)]
dp[0].append(0)
for i in range(N):
A[i] = [A[i],i+1]
A.sort(reverse=True)
for M in range(1,N+1):
Ai,i = A[M-1]
# x=0
dp[M].append(dp[M-1][0]+Ai*(N-(M-1)-i))
# 1<=x<=M-1
for x in range(1,M):
... | 198 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
org = [[i, a[i]] for i in range(n)]
lis = sorted(org, key=lambda x: x[1], reverse=True)
dp = [[0 for i in range(n+1)] for j in range(n+1)]
for i in range(0, n, 1):
for j in range(0, n-i, 1):
if i + j == n:
break
dp[i+... | 220 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
iA = [(i, A[i]) for i in range(N)]
iA.sort(key=lambda t: t[1], reverse=True)
dp = [[0]*(N+1) for _ in range(N+1)]
for i in range(N):
for j in range(N):
if i+j<N:
idx, v = iA[i+j]
dp[i+1][j] =... | 187 |
Project_CodeNet | 2,020 | from heapq import heappush, heappop
n = int(input())
A = list(map(int, input().split()))
hq = []
for i in range(n):
heappush(hq, (-A[i], i))
dp = [[0 for _ in range(n+1)] for _ in range(n+1)]
for i in range(n):
x, pi = heappop(hq)
for l in range(i+1):
r = i-l
dp[i+1][l+1] = max(dp[i+1... | 198 |
Project_CodeNet | 2,020 | from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import permutations,combinations
from collections import defaultdict,Counter
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint... | 781 |
Project_CodeNet | 2,020 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
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 | N = int(input())
A = [int(v) for v in input().split()]
P = sorted([(v, i) for i, v in enumerate(A)], key=lambda x: x[0], reverse=True)
dp = [[0 for j in range(2005)] for i in range(2005)]
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] + ... | 196 |
Project_CodeNet | 2,020 | n=int(input())
a=map(int,input().split())
babies=[(a,i) for i ,a in enumerate(a)]
babies.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
activeness,ind=babies[l+r]
dp[l+1][r]... | 159 |
Project_CodeNet | 2,020 | # import time
# p0 = time.time()
N = int(input())
A = list(map(int,input().split()))
# print(A)
A = [[A[i],i] for i in range(N)]
A.sort(reverse=True)
# print("A :",A)
dp = [[0]*(N+1) for _ in range(N+1)]
# print(dp)
#dp[x][y] : x人は Ai*(i-pi),y人は Ai*(pi-i)
# piは 0,1,2... piはN-1,N-2,N-3,,
# p1 = time.time()... | 409 |
Project_CodeNet | 2,020 | 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 _ in range(n + 1)]
for i in range(n + 1):
for j in range(n - i + 1):
k = i + j - 1
if k == -1:
continue
if i == 0:
dp[i][j] = dp[i][j ... | 276 |
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()
b = b[::-1]
#print(b)
dp = [[0]* (n+1) for i in range(n+1)]
cnt = 0
for i,j in b:
for k in range(cnt+1):
dp[cnt-k][k+1] = max(dp[cnt-k][k] + abs(n-1-j-k)*i,dp[cnt-k][k+1])
dp[cnt-k+1][k] = m... | 186 |
Project_CodeNet | 2,020 | def solve():
INF = float('inf')
def max2(x, y): return x if x >= y else y
N = int(input())
As = [(A, i) for i, A in enumerate(map(int, input().split()))]
As.sort(reverse=True)
dp = [[-INF]*(N+1) for _ in range(N+1)]
dp[0][0] = 0
for no, (A, pos) in enumerate(As):
for i in ran... | 223 |
Project_CodeNet | 2,020 | import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
IN=lambda : map(int, input().split())
mod=1000000007
#+++++
def main():
n = int(input())
al = list(IN())
#b , c = IN()
#s = input()
tl=[(v,i+1) for i,v in enumerate(al)]
tl.sort(reverse=True)
#print(tl... | 502 |
Project_CodeNet | 2,020 | from collections import defaultdict
N = int(input())
A = list(map(int, input().split()))
B = sorted([(A[i], i + 1) for i in range(N)], reverse=True)
dp = defaultdict(int)
for S in range(1, N + 1):
for x in range(S + 1):
y = S - x
candid = []
if x >= 1:
candid.append(dp[(x - 1,... | 201 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int,input().split()))
B = sorted([(a,i) for i,a in enumerate(A)])
dp = [[0]*(N+1) for _ in range(N+1)]
for i in range(N):
a,j = B.pop()
for k in range(i+1):
dp[k][i-k+1] = max(dp[k][i-k+1], dp[k][i-k] + a * abs(j-(N-1-(i-k))))
dp[k+1][i-k] = max(dp[k+1][i-k], dp[k]... | 153 |
Project_CodeNet | 2,020 | INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
'''
一つの整数
'''
return int(input())
def inpl():
'''
一行に複数の整数
'''
return list(map(int, input().split()))
def inpl_str():
'''
一行に複数の文字
'''
return list(input().split())
n=inp()
a = inpl()
sorted_a = sorted(a,reverse=Tru... | 352 |
Project_CodeNet | 2,020 | import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
import math
from copy import deepcopy
import queue
#import sympy as syp(素因数分解とか)
Mod = 1000000007
def sieve_of_eratosthenes(n):
if not isinstance(n,int):
... | 606 |
Project_CodeNet | 2,020 | N = int(input())
A = map(int, input().split())
B = [[i, a] for i, a in enumerate(A)]
C = sorted(B, key=lambda b: b[1], reverse=True)
dp = [[-1 for _ in range(N + 1)] for _ in range(N + 1)]
dp[1][0] = (C[0][0] - 0) * C[0][1]
dp[0][1] = ((N - 1) - C[0][0]) * C[0][1]
ans = 0
for i in range(2, N + 1):
for j in ran... | 307 |
Project_CodeNet | 2,020 | """
AtCoder Beginner Contest 163 E
・大きいものほど移動距離を増やしたいので、端にもっていく
を真っ先に思いつくので、大きいものから移動距離が大きくなるように配置すると、例２が答えと一致しない。
手を動かしてみると、
・大きいものから端にもっていく
は正しいそうだが、
・移動距離が最も大きくなるように
が当てはまらないことが見えてくる。
大きいものからi人目まで並べるときに、左側にx人配置されているなら、残りのi-x人が右側に配置されている。
・一人目は左右の端のいずれかに配置されうる
・二人目は、左端、その右隣、右端、その左隣、に配置されうる
・n人目は、左端からn番目まで、右端からn番目ま... | 1,125 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
import sys
import itertools
sys.setrecursionlimit(10**8)
INF = float("inf")
MOD = 10**9+7
N = int(input())
A = list(map(int, input().split()))
AA = [(a, i) for i, a in enumerate(A, start=1)]
AA.sort(reverse=True)
# print(AA)
DP = [[0]*(N+1) for _ in range(N+1)]
for wa in range(1, N+1):
#... | 280 |
Project_CodeNet | 2,020 | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(input())
a = list(map(int, input().split()))
a = [(num,i) for i,num in enumerate(a)]
a.sort(reverse=True)
dp = [[0]*(n+1) for _ in range(n+1)]
for i in range(n+1):
f... | 225 |
Project_CodeNet | 2,020 | n=int(input())
a=list(map(int,input().split()))
for i in range(n):
a[i]=(a[i],i)
b=sorted(a,reverse=True)
dp=[[-10**14 for i in range(n+1)] for j in range(n+1)]
dp[0][0]=0
for i in range(1,n+1):
see=b[i-1][0]
prv=b[i-1][1]
for j in range(i+1):
dp[j][i-j]=max(dp[j-1][i-j]+abs(prv-(j-1))*see,dp[j]... | 171 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
B = sorted(A, reverse=True)
C = [0] * N
i = 0
while(1):
if i >= N:
break
for j in range(N):
if A[j] == B[i]:
C[i] = j
if i != N-1 and B[i] == B[i+1]:
i += 1
i += 1
dp = [[0] * (N+1) for i in rang... | 350 |
Project_CodeNet | 2,020 | printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
n = inn()
a = inl()
b = [(a[i],i) for i i... | 383 |
Project_CodeNet | 2,020 | if __name__ == '__main__':
N = int(input())
Als = [int(a) for a in input().split()]
lst = []
for i in range(N):
lst.append([Als[i],i+1])
lst.sort(reverse = True)
DP = [[0] * (N+1) for _ in range(N+1)]
ans = 0
for i in range(1,N+1):
a = lst[i-1][0]
index = lst[i-1][1]
vx = DP[i-1][0] + a * abs(index-... | 314 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a... | 534 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int,input().split()))
ai = [(val, ind) for ind,val in enumerate(a)]
ai.sort(reverse=True)
dp = [[0] * (n+1) for _ in range(n+1)]
for i,tmp in enumerate(ai,1):
val , val_i = tmp
for right in range(i+1):
left = i-right
if(left==0):
dp[left][right] = dp[... | 233 |
Project_CodeNet | 2,020 | N = int(input())
a = list(map(int, input().split()))
A =[]
for i in range(N):
A.append([i+1,a[i]])
A.sort(key=lambda x: x[1], reverse=True)
dp = [[0] * (N+1) for i in [1] * (N+1)]
for i in range(N+1):
for x in range(i+1):
y = i - x
if x == 0 and y == 0:
dp[x][y] = 0
elif x == 0:
... | 311 |
Project_CodeNet | 2,020 | n = int(input())
xs = list(enumerate(map(int, input().split())))
xs.sort(key=lambda x: x[1])
xs.reverse()
dp = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
for i in range(1, n + 1):
(j, a) = xs[i - 1]
for x in range(0, i + 1):
y = i - x
if x == 0:
dp[x][y] = dp[x][y - 1] + a ... | 231 |
Project_CodeNet | 2,020 |
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
N = read_int()
A = read_ints()
dp = [
[0]*(N+1) for _ in range(N+1)
]
AI = sorted(((a, i) for i, a in enumerate(A)), reverse=True)
for i, (a, ix) in e... | 263 |
Project_CodeNet | 2,020 | def main():
import sys
input=sys.stdin.readline
n=int(input())
A=list(map(int,input().split()))
A_=[]
for i in range(n):
A_.append([A[i],i])
A_sorted=sorted(A_)[::-1]
dp=[[0]*(n+1) for _ in range(n+1)]
ans=0
for xy in range(1,n+1):
for x in range(xy+1):
... | 237 |
Project_CodeNet | 2,020 | # 入力
N = int(input())
A = [int(x) for x in input().split()]
# 初期化
dp = [[0] * (N+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(0,N):
# 最も嬉しさの高い子供から場所を選択していく
a = max(A)
id = A.index(a)
for x in range(0,i+1):
y = i - x
d = dp[x][y]
tmp = d + a * (id - x)
if ... | 245 |
Project_CodeNet | 2,020 | n=int(input())
a=list(map(int,input().split()))
a=list(zip(range(n),a))#[index,a]の配列
a.sort(key=lambda x:x[1])#aの昇順で並べる
dp=[[0 for i in range(n+1)]for j in range(n+1)] #dp[x][y]:=左にx、右にy人並べたときの最大値
ans=0
for k in range(n):# k人目まで終了、k+1人目に対して
i,ai=a.pop()#aの大きいものから取り出す
dp[k+1][0]=dp[k][0]+ai*(i-k)
dp[0][k+1]=dp[0][... | 275 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int,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] + a*abs(N-i-(k-l)))
curr[l+1] = prev[l]+a*abs(i-l-1)
prev = cu... | 123 |
Project_CodeNet | 2,020 | import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
if l... | 805 |
Project_CodeNet | 2,020 | # coding: utf-8
# Your code here!
#import numpy as np
N = int(input())
A = list(map(int,input().split()))
table = []
for i, a in enumerate(A):
table.append([a,i])
table.sort()
dp = [[0for i in range(N+1)]for j in range(N+1)]
for i in range(1,N+1):
baby,pos = table.pop()
dp[i][0]=dp[i-1][0]+baby*abs(pos-i+... | 207 |
Project_CodeNet | 2,020 | N = int(input())
A_list = map(int, input().split())
# [活発度, もとの番号] のリストを降順に並べる
A_list = [[A, index] for index, A in enumerate(A_list)]
A_list.sort(reverse=True)
# print(A_list)
dp = [[0 for i in range(N+1)] for j in range(N+1)]
# print(dp)
for left in range(0, N):
for right in range(0, N - left):
# pr... | 339 |
Project_CodeNet | 2,020 | N=int(input())
A=list(map(int,input().split()))
L=[[10**10,0]]
for i in range(N):
L.append([A[i],i])
L.sort(reverse=True)
#print(L)
DP=[[0 for i in range(N+1)]for j in range(N+1)]
#j=右に押し込んだ数
for i in range(1,N+1):
for j in range(i+1):
if j==0:
DP[i][j]=DP[i-1][j]+L[i][0]*abs(L[i][1]-(i-1))... | 345 |
Project_CodeNet | 2,020 | N=int(input())
A=list(map(int,input().split()))
B=[]
for k in range(N):
B.append([A[k],k+1])
B.sort(key=lambda x: x[0], reverse=True)
dp=[[0 for k in range(N+1)]for k in range(N+1)]
dp[1][0]=dp[0][0]+B[0][0]*(B[0][1]-1)
dp[0][1]=dp[0][0]+B[0][0]*(N-B[0][1])
for k in range(1,N):
#j=0
dp[0][k+1]=dp[0][k]+B[k]... | 417 |
Project_CodeNet | 2,020 | from sys import stdin
def chmin(a,b):
if a > b: return b
else: return a
def chmax(a,b):
if a < b: return b
else: return a
if __name__ == "__main__":
_in = [_.rstrip() for _ in stdin.readlines()]
N = int(_in[0]) # type:int
A_arr = list(map(int,_in[1].split(' '))) # type:list(int)
... | 351 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int,input().split()))
ans = 0
dp = [[0] * (n+1) for _ in range(n+1)]
li = []
for i in range(n):
li.append((a[i],i))
li.sort(reverse = True)
for i in range(1,n+1):
tmp = li[i-1]
for ii in range(i+1):
jj = i - ii
if ii == 0:
dp[ii][jj] = dp[ii][jj-... | 256 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int,input().split()))
from collections import Counter
dp = [[0 for _ in range(n+1)] for _ in range(n)]
cnt = Counter()
dic= {}
for i in range(n):
if dic.get(a[i]) is None:
dic[a[i]] = [i]
else:
dic[a[i]] += [i]
cnt[a[i]]+=1
def maximize(rang, pos):
lb_rang ... | 500 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(ro... | 320 |
Project_CodeNet | 2,020 | import os
import os
from collections import defaultdict
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
def argsort(li, key=None, reverse=False):
return [i for _, i in sorted(
[... | 314 |
Project_CodeNet | 2,020 | def f(n, a_list):
a_list = list(zip(range(n), a_list))
a_list.sort(key=lambda x: x[1])
# a_list[j][0]: (j + 1)番目に小さい活発度をもつ幼児の座標
# a_list[j][1]: ↑の活発度
dp = [0]
# dp[x]: x 人を左, (k - x) 人を右に置く場合
for k in range(1, n + 1):
dp_ = []
i, a = a_list.pop() # i: 座標, a: 活発度
dp_.... | 292 |
Project_CodeNet | 2,020 | def main():
import numpy as np
n=int(input())
a=list(enumerate(map(int,input().split())))
a.sort(key=lambda x: -x[1])
dp=[np.zeros(i+1,dtype=np.int64) for i in range(n+1)]
dp[0]=np.zeros(1,dtype=np.int64)
r=np.arange(n+1,dtype=np.int64)
for time,ix in enumerate(a):
i,x=ix
... | 182 |
Project_CodeNet | 2,020 | def main():
from operator import itemgetter
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
AP = []
for i in range(N):
AP.append((A[i], i))
AP.sort(key=itemgetter(0), reverse=True)
# dp[i][l][r]
... | 307 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
import sys
N = int(input())
A = list(map(int,input().split()))
B = []
for i,a in enumerate(A):
B.append([a,i])
B.sort(reverse = True)
#%%
def score(org_idx, sorted_idx):
s,idx = B[org_idx]
return s*abs(idx-sorted_idx)
dp = [[0]*(N+3) for _ in range(N+3)]
# dp[i][j] : 左からi個，右からj個詰... | 265 |
Project_CodeNet | 2,020 | N = int(input())
A = map(int, input().split())
A = sorted(enumerate(A), key=lambda x: x[1], reverse=True)
dp = [[0]*(N+1) for _ in range(N+1)]
for n, (from_i, a) in enumerate(A):
for j in range(n + 1):
dp[n+1][j+1] = max(dp[n+1][j+1], dp[n][j] + a*(from_i - j))
dp[n+1][j] = max(dp[n+1][j], dp[n][j... | 150 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int,input().split()))
b = list((x,i) for i,x in enumerate(a))
b.sort(reverse=True)
dp = [[0]*(n+1-i) for i in range(n+1)]
for i in range(n):
x,idx = b[i]
for j in range(i+1):
k = i-j
if dp[j+1][k] < dp[j][k] + x*(idx-j):
dp[j+1][k] = dp[j][k] + x*(idx-j)... | 204 |
Project_CodeNet | 2,020 | def main():
N = int(input())
A = list(map(int, input().split()))
# 全探索するとN!なのでN=2000のときO(N^2000)となるので無理
# DPで解く
# dp[i][l] = 係数が大きい順にi個左右の端どちらにつめるか決めて、左をl回(右はn-l回)選んだときの指標最大値
# 降順にAをソート+元のインデックスも保存しておく
Awithidx = [[a,i] for i,a in enumerate(A)]
sortedA = sorted(Awithidx, reverse=True)
... | 317 |
Project_CodeNet | 2,020 | n,*a = map(int,open(0).read().split())
a = sorted([(j,i) for i,j in enumerate(a)],reverse=True)
dp = [0]
for i,(j,k) in enumerate(a):
ldp = [abs(k-i+a)*j+b for a,b in enumerate(dp)]
rdp = [abs(n-1-k-a)*j+b for a,b in enumerate(dp)]
dp = [max(a,b) for a,b in zip(ldp+[0],[0]+rdp)]
print(max(dp)) | 116 |
Project_CodeNet | 2,020 | import sys
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
dp = [[0]*(N+1) for _ in range(N+1)]
B = [(a, i) for i, a in enumerate(A)]
B.sort(reverse=True)
for l, (a, i) in enumerate(B):
length = N-l
for left in range(l+1):
dp[left+1][left+length] = max(dp[left+1][left+... | 189 |
Project_CodeNet | 2,020 | def solve():
N = int(input())
#AAwIdx = list(map(int,input().split()))
AAwIdx = [(i,A) for i, A in enumerate(map(int, input().split()))]
#for i in range(N):
# AAwIdx[i][0] = i
# AAwIdx[i][1] = AA[i]
AA_sorted = sorted(AAwIdx, key=lambda x: x[1], reverse=True)
#print(AA_sorted)
... | 332 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int,input().split()))
B = [i for i in range(N)]
C = []
for i in range(N):
C.append([A[i],B[i]])
C = sorted(C,reverse=True)
dp = [[0] * (N+1) for i in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
dp[i][0] = dp[i-1][0] + C[i-1][0]*(-C[i-1][1]+N-i)
dp[0][i] = dp[0][i-1] + C[i-1... | 276 |
Project_CodeNet | 2,020 | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
sys.setrecursionlimit(10**6)
n = ni()
a = na()
b = []
for i in range(n):
b.append((a[i],i))
b.sort(reverse=True)
dp = [[0]*... | 208 |
Project_CodeNet | 2,020 | n = int(input())
a_ = [int(i) for i in input().split()]
a = [[a_[i], i+1] for i in range(n)]
a.sort(reverse=True)
dp = [[0 for i in range(n+1)] for j in range(n+1)]
ans = 0
for x_plus_y in range(n):
for x in range(x_plus_y + 1): #x：左に詰めた個数
y = x_plus_y - x #y：# 右に詰めた個数
dp[x][y+1] = max(dp[x][y+1], ... | 251 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
# vim: set fileencoding=utf-8
# pylint: disable=unused-import, invalid-name, missing-docstring, bad-continuation
"""Module docstring
"""
import functools
import heapq
import itertools
import logging
import math
import random
import string
import sys
from argparse import ArgumentParser
from co... | 947 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int,input().split()))
b = sorted(a, reverse=True)
dp = [[0]*(n+1) for _ in range(n+1)]
ans = 0
def f(s,e):
return abs(e-s)*a[s]
for i in range(n):
d = a.index(b[i])
for l in range(0,i+1):
r = i-l
dp[l+1][r] = max(dp[l+1][r], dp[l][r]+f(d,l))
dp[l][r+1] = max(dp[l][r+1], d... | 175 |
Project_CodeNet | 2,020 | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
n = ni()
a = nl()
lis = [(e, i) for i, e in enumerate(a)]
lis.sort()
dp = [... | 202 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
dp = [[0] * (n+1) for i in range(n+1)]
A = []
for i in range(n):
A.append([a[i], i])
A.sort(reverse=True)
for i in range(1, n+1):
for j in range(i+1):
if j == 0:
dp[j][i-j] = dp[j][i-j-1] + A[i-1][0] * abs(n-i-A[i-1][1])
elif j == ... | 259 |
Project_CodeNet | 2,020 | from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import time
import math
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
N=int(input())
A=list(map(int,input().split()))
A=[[A[i],i] for i in range(N)]
A.sort(reverse=Tru... | 247 |
Project_CodeNet | 2,020 | def main():
n = int(input())
tmp = list(map(int, input().split()))
a = [[v, i] for i, v in enumerate(tmp)]
a.sort(reverse=True)
dp = [[0]*(n+1) for _ in range(n+1)]
for i in range(n):
v, idx = a[i]
for j in range(i+1):
dp[i+1][j+1] = max(dp[i+1][j+1], dp[i][j]+v*abs(i... | 168 |
Project_CodeNet | 2,020 |
def main():
n = int(input())
arr = map(int, input().split())
arr = tuple(sorted(enumerate(arr), key=lambda tpl: -tpl[1]))
dp = [[0] * (n + 1) for _ in range(n + 1)]
for i, (p, a) in enumerate(arr):
for l in range(i + 1):
dp[i + 1][l] = max(dp[i + 1][l], dp[i][l] + a * abs(p - (n - (i - l) - 1)))
... | 171 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(1000000)
def solve(N, A):
q = [(a, i) for i, a in enumerate(A)]
q.sort(reverse=True)
dp = [[-1 for _ in range(N + 1)] for __ in range(N + 1)]
x = 0
y = 0
dp[x][y] = 0
for a, i in q:
dp[x+1][y] = dp[x][y] + a * abs(i - x)
x += 1
x = 0
... | 538 |
Project_CodeNet | 2,020 | def e_active_infants():
# 参考: https://kmjp.hatenablog.jp/entry/2020/04/20/0900
N = int(input())
A = [int(i) for i in input().split()]
# どこから移動するかの情報が必要なので、付与する
p = sorted([(a, k) for k, a in enumerate(A)], reverse=True)
# dp[x][y]: 元の場所から (元の場所を含んで) 左に動いた人数が x 人、
# 右に動いた人数が y 人のときのうれしさの最大値
... | 377 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.