Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #![allow(unused_imports, unused_macros, dead_code)]
macro_rules! min {
(.. $x:expr) => {{
let mut it = $x.iter();
it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
}};
($x:expr) => ($x);
($x:expr, $($ys:expr),*) => {{
let t = min!($($ys),*);
if $x < t { $x } else { t }
... | 970 |
Project_CodeNet | 2,020 | use std::collections::BinaryHeap;
use std::cmp;
use num::abs;
use proconio::input;
fn main() {
input! {
n : usize,
a : [i64; n]
};
let mut qu = BinaryHeap::new();
for i in 0..n {
qu.push((a[i], i));
}
let mut dp = vec!(vec!(0; n+1); n+1);
for i in 0..n {
let ... | 281 |
Project_CodeNet | 2,020 | // This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
use proconio::{fastout, input};
use std::cmp::max;
#[fastout]
fn main() {
input! {
n: usize,
a: [u64; n],
}
let a = {
let mut a = a
.iter()
.enu... | 207,717 |
Project_CodeNet | 2,020 | #![allow(unused_imports)]
#![allow(unused_macros)]
#![allow(non_snake_case)]
#![allow(dead_code)]
#![allow(unused_variables)]
#![allow(unused_mut)]
#![allow(unused_assignments)]
use proconio::input;
use proconio::marker::Usize1;
use std::collections::*;
use std::cmp::*;
use std::f64::consts::*;
const MOD: u64 = 100000... | 366 |
Project_CodeNet | 2,020 | use std::cmp;
use std::io::{stdin, Read};
macro_rules! parse {
($it: ident ) => {};
($it: ident, ) => {};
($it: ident, $var:ident : $tr:tt $($r:tt)*) => {
let $var = parse_val!($it, $tr);
parse!($it $($r)*);
};
($it: ident, mut $var:ident : $tr:tt $($r:tt)*) => {
let mut $va... | 599 |
Project_CodeNet | 2,020 | #![allow(unused_imports)]
use std::cmp::*;
use proconio::*;
#[fastout]
fn main() {
input! {
n: usize,
A: [i64; n],
}
let mut prev = A.iter().zip(0..n).collect::<Vec<_>>();
prev.sort();
let mut dp: Vec<i64> = (0..n+1).map(|_| 0).collect();
for i in 0..n {
let (a, pos) = prev[i];
... | 186 |
Project_CodeNet | 2,020 | <?php
$N = (int)trim(fgets(STDIN));
$A = explode(' ', fgets(STDIN));
$A = array_map(function ($a) {
return (int)$a;
}, $A);
$ans = 0;
$dp = [];
$dp[0][0] = 0;
for ($i = 0; $i < $N; $i++) {
$max_A = max($A);
$index = array_keys($A, $max_A)[0];
$A[$index] = 0;
$dp[$i + 1][0] = $dp[$i][0] + $max_A * a... | 312 |
Project_CodeNet | 2,020 | def max(a, b)
a > b ? a : b
end
n = read_line.to_i64
ais = read_line.split.map(&.to_i64)
vals = ais.map_with_index {|a, loc| {loc.to_i64, a}}.sort_by! {|(loc, a)| a}.reverse!
dp = Array(Array(Int64)).new(n + 1) { Array(Int64).new(n + 1, 0_i64) }
vals.each_with_index do |(loc, a), i|
remains = vals.size.to_i64 - i
... | 244 |
Project_CodeNet | 2,020 | n = read_line.to_i
a = read_line.split.map_with_index { |v, i| {v.to_i64, i} }.sort.reverse
dp = Array.new(n + 1) { Array.new(n + 1, 0i64) }
n.times do |i|
0.upto(i) do |right|
left = n - 1 - (i - right)
dp[i + 1][right + 1] = {dp[i + 1][right + 1], dp[i][right] + a[i][0] * (a[i][1] - right).abs}.max
dp[i... | 192 |
Project_CodeNet | 2,020 | let input f = stdin.ReadLine() |> f
let inputs f = stdin.ReadLine().Split() |> Array.map f
let N = input int
let A = inputs int64
let ord = [|0..N-1|] |> Array.sortByDescending (fun i -> A.[i])
let inf = System.Int64.MinValue
let dp = Array2D.create (N + 1) (N + 1) inf
dp.[0, 0] <- 0L
for i in 0..N-1 do
for j in... | 270 |
Project_CodeNet | 2,020 | package main
import "fmt"
type infant struct{
value int
pos int
}
func printdp(dp []int, n int) {
for i:=0 ; i<n; i++ {
for j:=0 ; j<n ; j++ {
fmt.Printf("%v ",dp[i*n+j])
}
fmt.Println("")
}
}
func returnhappy(sort []infant, num int, n int, turn int) int { // turn 0:up, 1:left
if num < n {
return so... | 786 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
"fmt"
"os"
"sort"
"strconv"
)
var sc = bufio.NewScanner(os.Stdin)
func Scanner() string {
sc.Scan()
return sc.Text()
}
func intScanner() int {
n, _ := strconv.Atoi(Scanner())
return n
}
func main() {
buf := make([]byte, 0)
sc.Buffer(buf, 1000000007)
sc.Split(bufio.ScanWord... | 444 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
"errors"
"fmt"
"io"
"math"
"os"
"sort"
"strconv"
)
/*********** I/O ***********/
var (
// ReadString returns a WORD string.
ReadString func() string
stdout *bufio.Writer
)
func newReadString(ior io.Reader, sf bufio.SplitFunc) func() string {
r := bufio.NewScanner(ior)
... | 2,684 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
"fmt"
"os"
"sort"
"strconv"
)
func getScanner(fp *os.File) *bufio.Scanner {
scanner := bufio.NewScanner(fp)
scanner.Split(bufio.ScanWords)
scanner.Buffer(make([]byte, 1000005), 1000005)
return scanner
}
func getNextString(scanner *bufio.Scanner) string {
scanner.Scan()
return... | 869 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
. "fmt"
"io"
"os"
"sort"
)
// github.com/EndlessCheng/codeforces-go
func run(_r io.Reader, _w io.Writer) {
abs := func(x int) int {
if x < 0 {
return -x
}
return x
}
type pair struct{ v, i int }
in := bufio.NewReader(_r)
var n int
Fscan(in, &n)
a := make([]pair, n)
... | 384 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
"fmt"
"os"
"sort"
"strconv"
)
func out(x ...interface{}) {
fmt.Println(x...)
}
var sc = bufio.NewScanner(os.Stdin)
func getInt() int {
sc.Scan()
i, e := strconv.Atoi(sc.Text())
if e != nil {
panic(e)
}
return i
}
func getString() string {
sc.Scan()
return sc.Text()
}
/... | 493 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
"fmt"
"os"
"sort"
"strconv"
)
var sc, wr = bufio.NewScanner(os.Stdin), bufio.NewWriter(os.Stdout)
func scanString() string { sc.Scan(); return sc.Text() }
func scanRunes() []rune { return []rune(scanString()) }
func scanInt() int { a, _ := strconv.Atoi(scanString()); r... | 772 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
"os"
"strconv"
"strings"
"fmt"
"sort"
)
type Infant [][]int
func (I Infant) Len() int { return len(I) }
func (I Infant) Less(i, j int) bool { return I[i][0] < I[j][0] }
func (I Infant) Swap(i, j int) { I[i], I[j] = I[j], I[i] }
func Solve() {
var N int
NextInt(&N)
var A... | 868 |
Project_CodeNet | 2,020 | package main
import (
"bufio"
"fmt"
"os"
"reflect"
"sort"
"strconv"
)
var sc = bufio.NewScanner(os.Stdin)
var out = bufio.NewWriter(os.Stdout)
type Child struct {
i int
Ai int
}
type Children []Child
func (c Children) Len() int {
return len(c)
}
func (c Children) Swap(i, j int) {
c[i], c[j] = c[j], c[i... | 1,353 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define ll long long
#define INF 1<<31-1
#define LNF 9223372036854775807
#define PI 3.14159265358979
#define MIN(x,y) ((x)<(y)?(x):(y))
#define MAX(x,y) ((x)<(y)?(y):(x))
#define FOR(i,a,n) for(i=a;i<n;i++)
#define MOD 1000000007
//#define MOD 998244353
#define N... | 810 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<stdbool.h>
#include<math.h>
#define MAX 2001
typedef long long ll;
ll N, A[MAX];
ll hash[MAX];
ll DP[MAX][MAX];
ll max(ll x, ll y)
{
if (x > y)
return x;
else
return y;
}
void swap(ll * a, ll * b)
{
ll buf = *a;
*a = *b;
... | 668 |
Project_CodeNet | 2,020 | #include <malloc.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
//abc163E
void swap(long long *a, long long *b) {
long long temp=*a;
*a=*b, *b=temp;
}
void QuickSort(long long A[], long long B[], long long left, long long right) { //クイックソート//
int Left=left, Right=right, pivot=A[... | 759 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<stdlib.h>
#define ll long long
ll dp[2048][2048];
ll n, i, j;
ll max(ll a, ll b){return a > b ? a : b;}
ll min(ll a, ll b){return a < b ? a : b;}
ll zt(ll a, ll b){return max(a, b) - min(a, b);}
struct child{ ll A, r; };
struct child a[2048];
int cmp(const void *x,const void *y){
int a = ... | 395 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <stdlib.h>
#define max(a, b) ((a)>(b)?(a):(b))
struct node {
struct node *left;
struct node *right;
int index;
int activity;
};
struct node *
insert(struct node *p, int act, int index)
{
int cmp;
if (p == NULL) {
p = (struct node *)malloc(sizeof(struct node));
p->left = (struct... | 693 |
Project_CodeNet | 2,020 | //set many funcs template
//Ver.20190820
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<stdbool.h>
#include<time.h>
#include<assert.h>
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int max(int a,int b){if(a>b){return a;}return b;}
int... | 2,178 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdint.h> // uint64_t
#define max(a,b) ((a) > (b) ? (a) : (b))
#define min(a,b) ((a) > (b) ? (b) : (a))
#define ARR_MAX 2000
#define BUF_SIZE (ARR_MAX*11+50)
int get_int(void) {
int num;
#ifdef BUF_SIZE
char line[BUF_SIZE];
if(!fgets(line, BUF... | 675 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#define MOD 1000000007LL
const long long INF = 1LL << 60;
#define MIN(x,y) ((x)<(y)?(x):(y))
#define MAX(x,y) ((x)<(y)?(y):(x))
typedef long long ll;
typedef struct Child{
ll a;
ll idx;
}child;
int ascend(const void *n,const void *... | 428 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<math.h>
#include<stdlib.h>
#define MAX(x,y) ((x)<(y)?(y):(x))
typedef struct{
int num;
long long int Happy;
}Human;
int koujun(const void*a,const void*b){
return ((Human*)b)->Happy-((Human*)a)->Happy;
};
int main(){
long long int chi_n,sum=0;
scanf("%lld",&chi_n);
Human chil... | 348 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<stdlib.h>
long long R=1,C=1,H[2000010],N[2000010];
//評価関数（いまはMIN）
int hyouka(int a,int b){
if(C<b)return 1;
if(C<a||b==0)return 0;
return N[H[a]]>N[H[b]]?1:0;
}
//挿入関数
void hin(long long a){
int i=C++;
for(N[H[0]=R]=a;hyouka(0,i/2);i/=2)H[i]=H[i/2];
H[i]=R++;
}
//取り出す関数
int hout()... | 471 |
Project_CodeNet | 2,020 | #include <stdio.h>
typedef struct {
int key, id;
} data;
typedef struct {
data obj[2001];
int size;
} max_heap;
void push(data x, max_heap* h)
{
int i = ++(h->size);
data tmp;
h->obj[i] = x;
while (i > 1) {
if (h->obj[i].key > h->obj[i>>1].key) {
tmp = h->obj[i>>1];
h->obj[i>>1] = h->obj[i];
h->obj... | 630 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<stdbool.h>
#include<math.h>
#define MAX 2001
typedef long long ll;
ll N, A[MAX];
ll hash[MAX];
ll DP[MAX][MAX];
ll max(ll x, ll y)
{
if (x > y)
return x;
else
return y;
}
void swap(ll * a, ll * b)
{
ll buf = *a;
*a = *b;
*b = buf;
}
void solve(ll x, ll... | 526 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define ll long long int
#define MO 1000000007
struct hoge{
int p,A;
};
int ll_cmp(const void* a,const void* b){
if ((*(ll*)a)>(*(ll*)b)) return -1;
if ((*(ll*)a)<(*(ll*)b)) return 1;
return 0;
}
ll a[2020][2];
ll dp[2020][2020];
ll max(ll a,ll b){
i... | 494 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
struct hoge {
int p, A;
};
int cmp(const void* x, const void* y) {
int a = ((const struct hoge*)x)->A, b = ((const struct hoge*)y)->A;
return a > b ? -1 : a < b;
}
int N;
int A[2222];
struct hoge h[2222];
int64_t memo[2222][2222];
int64_t search(int... | 394 |
Project_CodeNet | 2,020 | #include <float.h>
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
// 内部定数
#define D_HUMAN_MAX 2000 // 最大幼児数
// 内部構造体 - 幼児情報
typedef struct Human {
int miNo; // 位置
long long mlVal; // うれしさ
} Human;
// 内部変数
static FILE... | 1,527 |
Project_CodeNet | 2,020 | local mmi, mma = math.min, math.max
local mab = math.abs
local n = io.read("*n")
local t = {}
for i = 1, n do
t[i] = {io.read("*n")}
t[i][2] = i
end
table.sort(t, function(a, b) return a[1] > b[1] end)
local dp = {}
for i = 1, n do
local val, idx = t[i][1], t[i][2]
dp[i] = {}
for j = 1, i + 1 do
-- j: lef... | 356 |
Project_CodeNet | 2,020 | unittest
{
assert( [ "4", "1 3 4 2" ].parse.expand.solve == 20 );
assert( [ "6", "5 5 6 1 1 1" ].parse.expand.solve == 58 );
assert( [ "6", "8 6 9 1 2 1" ].parse.expand.solve == 85 );
assert( [ "4", "10 10 10 1" ].parse.expand.solve == 62 ); // 追加ケース
assert( [ "3", "10 10 1" ].parse.expand.solve == 31 ); // 追加... | 524 |
Project_CodeNet | 2,020 | import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
alias C = Tuple!(int, "i", long, "a");
void main()
{
auto N = readln.chomp.to!int;
long[] AS;
C[] cs;
foreach (i, a; readln.split.to!(long[])) {
AS ~= a;
cs ~= C(i.to!int, a);
}
... | 286 |
Project_CodeNet | 2,020 | import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop;
immutable long MOD = 10^^9 + 7;
void main() {
auto N = readln.chomp.to!int;
auto A = readln.split.map!(to!long).array;
auto B =... | 264 |
Project_CodeNet | 2,020 | import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(... | 897 |
Project_CodeNet | 2,020 | import std.stdio;
import std.string;
import std.format;
import std.conv;
import std.typecons;
import std.algorithm;
import std.functional;
import std.bigint;
import std.numeric;
import std.array;
import std.math;
import std.range;
import std.container;
import std.concurrency;
import std.traits;
import std.uni;
import s... | 1,421 |
Project_CodeNet | 2,020 | n=int(input())
x=list(map(int,input().split()))
a=sorted([(int(v),i)for i,v in enumerate(x)],reverse=True)
dp=[[0]*(n+1)for i 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 i,v in enumerate(a[1:]):
dp[i+1][0]=dp[i][0]+v[0]*abs(n-1-(i+1)-v[1])
dp[i+1][i+2]=dp[i][i+1]+v[0]*abs(v[1]-(i+1))
... | 237 |
Project_CodeNet | 2,020 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, a... | 380 |
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 | #################################3
#################################3
#################################3
#################################3
def read(container_type, data_type):
return container_type(data_type(x) for x in input().split())
n, = read(tuple, int)
arr = read(list, int)
i_sorted = sorted(range(n), k... | 391 |
Project_CodeNet | 2,020 | cimport cython
@cython.boundscheck(False)
cdef main():
cdef long n,a,i,j,k
cdef list d
n=int(input())
d=[0]+[-10**18]*n
for j,(a,i)in enumerate(sorted((-a,i)for i,a in enumerate(map(int,input().split())))):
d=[max(t-a*abs(~i-j+k+n),d[k-1]-a*abs(~i+k))for k,t in enumerate(d)]
print(max(d)... | 115 |
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
... | 181 |
Project_CodeNet | 2,020 | from heapq import heappop, heappush
import numpy as np
def solve(n, a_list):
h = []
for i in range(n):
heappush(h, (-a_list[i], i))
# dp
dp = (-10 ** 18) * np.ones((n + 1, n + 1), dtype=np.int)
dp[0, 0] = 0
for i in range(n):
a, k = heappop(h)
# add left
dp[i + ... | 432 |
Project_CodeNet | 2,020 | import math
import fractions
import collections
import itertools
import pprint
N=int(input())
A=list(map(int,input().split()))
que=[]
dp=[[0 for _ in range(N+1)] for _ in range(N+1)] #dp[i][j]…左にiこ、みぎにjこあること状態になった時の最大をいれる
for i in range(N):
que.append([A[i],i])
que.sort(key=lambda x:x[0],reverse=True)
#pprint.pp... | 568 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
b = list(range(n))
b.sort(key=lambda x: -a[x])
DP = [-float("inf")]*(n+1)
for i in range(n):
if i == 0:
DP[1] = a[b[i]]*b[i]
DP[0] = a[b[i]]*(n-1-b[i])
else:
nxt = [-float("inf")]*(n+1)
for j in range(i+2):
if j =... | 207 |
Project_CodeNet | 2,020 | from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(2000)
N = int(stdin.readline().rstrip())
As = [int(x) for x in stdin.readline().rstrip().split()]
A_mat = []
for i,A in enumerate(As):
A_mat.append([A,i])
A_mat.sort(reverse=True)
map1 = []
for i in range(N+1):
temp = [-1]*(N+1)
... | 297 |
Project_CodeNet | 2,020 | import bisect,sys
import math
from collections import deque
def sRaw():
return input().rstrip("\r")
def iRaw():
return int(input())
def ssRaw():
return input().split()
def isRaw():
return list(map(int, ssRaw()))
INF = 1 << 29
DIV = (10**9) + 7
def mod_inv_prime(a, mod=DIV):
return pow(a, m... | 648 |
Project_CodeNet | 2,020 | # coding: utf-8
import sys
import math
import collections
import itertools
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def lcm(x, y) : return (x * y) // math.gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input(... | 398 |
Project_CodeNet | 2,020 | n,*a=map(int,open(0).read().split())
a=sorted([(j,i) for i,j in enumerate(a)])[::-1]
dp=[[-1]*(n+1) for _ in range(n+1)]
dp[0][0]=0
for m,(a_k,k) in enumerate(a):
for i in range(m+1):
j=m-i
dp[i+1][j]=max(dp[i+1][j],dp[i][j]+a_k*abs(k-i))
dp[i][j+1]=max(dp[i][j+1],dp[i][j]+a_k*abs(k-((n-1)-j)))
ans=0
for ... | 171 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
N = int(input().strip())
A_list = list(map(int, input().rstrip().split()))
#-----
# A_index[i] = ( value of A , index of A)
A_index = [ (A_list[i], i) for i in range(len(A_list)) ]
A_index.sort(reverse=True)
# dp[left][right] = score
dp = [ [0]*(N+1) for _ in range(N+1) ]
for L in range(N)... | 241 |
Project_CodeNet | 2,020 | def main():
n, *a = map(int, open(0).read().split())
dp = [[0] * (n + 1) for _ in range(n + 1)]
for t, (c, k) in enumerate(sorted((c, k) for k, c in enumerate(a))[::-1]):
for i in range(t + 1):
j = t - i
if dp[i + 1][j] <= (s := dp[i][j] + c * abs(i - k)): dp[i + 1][j] = s
if dp[i][j + 1] <= (s := dp[i][j... | 192 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
import math
def abs(num):
if num < 0:
return -num
else:
return num
def abc163e(n, a):
hap_dict = dict()
hap_list = []
for elem in range(n):
if a[elem] in hap_dict:
hap_dict[a[elem]].append(elem)
else:
tmp_list = [... | 451 |
Project_CodeNet | 2,020 | from operator import itemgetter
def main():
n = int(input())
a = sorted(enumerate(map(int, input().split())), key=itemgetter(1), reverse=True)
dp = [[0] * (n + 1) for _ in range(n + 1)]
for x in range(n):
for y in range(n - x):
i, ai = a[x + y]
dp[x + 1][y] = max(ai * (i... | 181 |
Project_CodeNet | 2,020 | n = int(input())
a = [(int(x), i+1) for i, x in enumerate(input().split())]
a = sorted(a, reverse=True)
dp = [[0]*(n+1) for __ in range(n+1)]
for k in range(1, n+1):
child = a[k-1][0]
ind = a[k-1][1]
for i in range(k+1):
if i != 0:
dp[i][k-i] = dp[i-1][k-i] + child*(ind-i)
if ... | 191 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
Ab = []
for i in range(N):
Ab.append([A[i], i])
Ab.sort(reverse=True)
#dp[i][j] Aの大きいじゅんにi個とったとき、左寄せj個、右寄せi-j個としたときのMAX
dp = [[0 for _ in range(N+5)] for _ in range(N+5)]
dp[0][0] = 0
for i in range(0,N):
a, p = Ab[i]
for j in range(0,i+1):
r = i - j
... | 255 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
a = list(enumerate(a))
a.sort(key=lambda x: x[1])
# dp[left + right][left]
dp = [[] for _ in range(n+1)]
dp[0].append(0)
for i in range(1, n+1): # i = left + right
ind, act = a.pop(-1)
# all right
dp[i].append(dp[i-1][0] + act * (n - i - ind))
# ... | 238 |
Project_CodeNet | 2,020 | #!python3
# input
N = int(input())
A = list(map(int, input().split()))
# N = 2000
# A = [i for i in range(1, N + 1)]
def main():
P = [(A[i], i + 1) for i in range(N)]
P.sort(reverse=True)
dp = [[0] * (N + 1) for _ in range(N + 1)]
for n, p in zip(range(1, N + 1), P):
x, y = p
for i i... | 252 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
import sys
def solve(N: int, A: "List[int]"):
from collections import defaultdict
dp = defaultdict(int)
B = sorted(enumerate(A), key=lambda x: x[1], reverse=True)
for step, (i, a) in enumerate(B, 1):
#print('i={}, a={}'.format(i, a))
for left in range(step):
... | 399 |
Project_CodeNet | 2,020 | N, *A = map(int, open(0).read().split())
x = sorted([(a, p) for p, a in enumerate(A)], reverse=True)
dp = [[0] * (N + 1) for _ in range(N + 1)]
for i, (a, p) in enumerate(x):
for j in range(i + 1):
dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j] + a * (p - j))
dp[i + 1][j] = max(dp[i + 1][j], dp[... | 164 |
Project_CodeNet | 2,020 | import numpy as np
n = int(input())
A = list(map(int, input().split()))
babies = sorted([(activity, index) for index, activity in enumerate(A, 1)], reverse=True)
DP = np.zeros(n+1, dtype=np.int64)
position = np.arange(1, n+1, dtype=np.int64)
for filled, (activity, index) in enumerate(babies, 1):
to_left = DP[:f... | 172 |
Project_CodeNet | 2,020 | n,*a=map(int,open(0).read().split())
MX=2005
dp=[0]*(MX*10000+MX+100)
p=sorted([(a[i]*MX+i) for i in range(n)])[::-1]
for i in range(n):
ai,pi=divmod(p[i],MX)
for l in range(n):
r=i-l
if not 0<=r<=n:
break
dp[(i+1)*10000+(l+1)]=max(dp[(i+1)*10000+(l+1)],dp[(i)*10000+(l)]+ai*... | 220 |
Project_CodeNet | 2,020 | n = int(input())
A = list(map(int, input().split()))
a = []
for i in range(len(A)):
a.append([A[i], i])
a.sort(key = lambda x: x[0], reverse = True)
dp = [[0 for i in range(n+1)] for j in range(n+1)]
for i in range(n):
for l in range(i+1):
dp[i+1][l] = max(dp[i+1][l], dp[i][l] + a[i][0]*(n-1-(i-l)-a[i][... | 188 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect, heapq
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n = int(input())
A = list(map(int,input().split()))
data = [(ai,i) for i,ai in enumerate(A)]
dat... | 251 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(10 ** 7)
N = int(input())
infants = []
for i, A in enumerate(map(int, input().split(' '))):
infants.append((-A, i + 1))
infants.sort()
dp = [[-1 for _ in range(N + 1)] for _ in range(N + 1)]
def search(i, l):
# i番目の幼児を見ていて左にl人配置している
if i == N:
return 0
if dp[i... | 227 |
Project_CodeNet | 2,020 | n = int(input())
al = list(map(int,input().split()))
al_id = [(a, idx) for idx, a in enumerate(al)]
al_id = sorted(al_id, reverse=True)
dp = [[-float("inf") for i in range(n+1)] for j in range(n+1)]
dp[0][0] = 0
for count, (a, idx) in enumerate(al_id):
for i in range(count+1):
j = count - i
dp[i+1]... | 201 |
Project_CodeNet | 2,020 | from sys import stdin
def main():
n = int(stdin.readline())
a = list(map(int, stdin.readline().split()))
a2 = [[a[i], i] for i in range(n)]
a2.sort(reverse=True)
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 - i):
... | 253 |
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]*(n+1) for i in range(n+1)]#左、右から何人いるか dpはl,r埋まってるときの最大スコア 家庭菜園
ans=0
for l in range(n):
for r in range(n):
if l+r==n:
ans=max(ans,dp[l][r])
break
activen... | 208 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(10000)
n = int(input())
*A, = map(int, input().split())
A = [(a, i) for i, a in enumerate(A)]
A.sort(reverse=True)
DP = [[None for r in range(n+1)] for l in range(n+1)]
def dp(l, r):
if l == r:
DP[l][r] = 0
if DP[l][r] != None:
return DP[l][r]
a, i = A[n-(r-... | 178 |
Project_CodeNet | 2,020 | def slove(n, a_list):
dp = [[0]*(n+1) for i 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]+a_list[i+j][0]*abs(a_list[i+j][1]-i))
dp[i][j+1] = max(dp[i][j+1],
dp[i][j]+a_list[i+j][0]*a... | 182 |
Project_CodeNet | 2,020 | #python3ではTLE
#input
N = int(input())
A = list(map(int, input().split()))
#output
B = [(i, a) for i, a in enumerate(A)]
B = sorted(B, key = lambda x:x[1], reverse = True)
dp = [[0] * (N+1) for i in range(N+1)]
#dp[i, j]を左i, 右jまで場所が決まった状態の最大値とする。
#i+j = Nとなる場合の最大値が答えとなる。
answer = 0
for i in range(N):
dp[i+1][0] =... | 309 |
Project_CodeNet | 2,020 | import sys
import time
t = time.time()
n = int(input())
a = list(map(int, input().split(' ')))
b = list(range(n))
b.sort(key=lambda x: -a[x])
# print("b after:", b)
# print(list(map(lambda x:a[x],b)))
# print(time.time()-t)
cache = [[-1 for x in range(n)] for y in range(n)]
# print(cache)
def dfs(left, right):
... | 220 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int,input().split()))
b = [(a[i],i+1) for i in range(n)]
b.sort(reverse=True)
cntf = 0
cntb = n-1
dp = [[0 for i in range(n+1)] for j in range(n+1)]
dp[0][1] = -10**18
for i in range(1,n+1):
x,ind = b[i-1]
dp[i][0] = dp[i-1][0]+abs(n-i-ind+1)*x
for j in range(1,i+1):
dp[i][j] = m... | 180 |
Project_CodeNet | 2,020 | def solve(N, A):
a = [(i, ai) for i, ai in enumerate(A)]
a.sort(key=lambda x: x[1], reverse=True)
# import numpy as np
# dp = np.zeros((N+1, N+1), np.int8)
dp = [[0] * (N + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i, ai in enumerate(a):
for l in range(i+1):
r = i - l... | 236 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
b = [(i, a[i]) for i in range(n)]
b = sorted(b, key=lambda x: x[1])[::-1]
dp = [[0] * (n+1) for _ in range(n+1)]
ans = 0
for l in range(0, n+1):
for r in range(0, n+1):
if l + r == n:
ans = max(ans, dp[l][r])
break
idx, ac... | 198 |
Project_CodeNet | 2,020 | from heapq import heappush, heappop
from math import inf
import numpy as np
n = int(input())
A = []
[heappush(A, (-v, i)) for i, v in enumerate(map(int, input().split()), 1)]
dp = np.full((n + 1, n + 1), -inf, dtype=int)
dp[0, 0] = 0
for i in range(n):
v, j = heappop(A)
v = -v
dp[i + 1, 1:] = dp[i, :-1]... | 199 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int, input().split()))
table = []
for i, a in enumerate(A):
table.append([a,i])
table.sort()
# DP[i][j] 左端に i 個, 右端に j 個貪欲に詰めたときのうれしさ
DP = [[0 for i in range(N+1)] for j in range(N+1)]
for i in range(1,N+1):
# i 人目 table[i-1] の幼児を移動させる
baby, pos = table.pop()
DP[i][0... | 293 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
import sys
N=int(sys.stdin.readline().strip())
A=map(int, sys.stdin.readline().split())
AA=[]
for i,val in enumerate(A):
AA.append((val,i+1))
AA.append((float("inf"),None)) #1-indexedにする
AA.sort(reverse=True)
dp=[ [ 0 for r in range(N+1) ] for l in range(N+1) ]
dp[0][0]=0
l=0
for l in r... | 220 |
Project_CodeNet | 2,020 | INF=float('inf')
N=int(input())
arr=list(map(int,input().split()))
A=[]
for i in range(N):
A.append((arr[i],i))
A.sort(key=lambda x:x[0],reverse=True)
dp=[[-INF]*(N+1) for i in range(N+1)]
dp[0][0]=0
for i in range(N):
a,w=A[i]
for x in range(N+1):
y=i-x+1
if x>0:
dp[i+1][x]=ma... | 177 |
Project_CodeNet | 2,020 | n = int(input())
a = sorted([(v,k) for k,v in enumerate(list(map(int, input().split())))], reverse=True)
dp = [[-(10 ** 18)] * (n+1) for i in range(n+1)]
dp[0][0] = 0
for i,(v,k) in enumerate(a):
for j in range(i+1):
left = j
right = n-1-(i-j)
dp[i+1][j] = max(dp[i+1][j], dp[i][j] + v * abs(k-right))
... | 165 |
Project_CodeNet | 2,020 | n = int(input())
a = sorted((int(x), k) for k, x in enumerate(input().split()))
opt = [[0 for j in range(n + 1)] for i in range(n + 1)]
for i in reversed(range(n)):
for j in range(i, n):
val, k = a[j - i]
opt[i][j] = max(val * abs(k - i) + opt[i + 1][j], val * abs(k - j) + opt[i][j - 1])
print(opt[0... | 122 |
Project_CodeNet | 2,020 | from collections import deque
N = int(input())
A = sorted([(int(j),i) for i, j in enumerate(input().split())])[::-1]
d = deque([(0,0)])
dp = [[0 for _ in range(N + 1)] for _ in range(N + 1)]
while(len(d)>0):
i, j = d.pop()
if i + j > N - 1:
continue
tmp = dp[i][j] + A[i+j][0] * abs(A[i+j][1] - i)
... | 277 |
Project_CodeNet | 2,020 | n = int(input())
a = list(map(int, input().split()))
a = list(enumerate(a))
a.sort(key = lambda x: x[1])
DP = [[0 for i in range(n+1)] for j in range(n+1)]
DP[0][0] = 0
for i in range(1, n+1):
pos, val = a.pop()
pos = pos + 1
DP[0][i] = DP[0][i-1] + abs(val * (n - i + 1 - pos))
DP[i][0] = DP[i-1][0] ... | 238 |
Project_CodeNet | 2,020 | def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
n=int(input())
ar=lis()
data=[]
for i in range(n):
data.append((ar[i],i))
data.sort(reverse=True)
dp = [[0] * (n+1) for _ in range(n+1)]
for i in range(n):
a, p = data[i]
for j in range(i+1):
dp[i+1][j+1] =... | 171 |
Project_CodeNet | 2,020 | '''
着想：大きいaほど左右の端に移動したい、小さいaを先に端にやるより必ず大きくなるから
問題：単純に貪欲に大きいaから左端(x-1)と右端(N-x)の大きい方に移動すると、
残りのaの組み合わせ的に最適でない場合がある
アイテムの左右端の単純な割り振りはO(2^N)
解決策の着想：大きい順のk個を(k=L+R)となる
左L個右R個にどのように割り振っても(k+1)個目の最適な割り振り方は変わらない
解決策：アイテムk個左右に割り振る状態をdp[L][R]で保存O(N^2)
'''
def solve():
N = int(input())
A = [[a, i] for a,i i... | 497 |
Project_CodeNet | 2,020 | n=int(input())
arr=list(map(int,input().split()))
arr=[[arr[i],i] for i in range(n)]
arr=sorted(arr,reverse=True,key=lambda x:x[0])
dp=[[-1]*(n+1) for _ in range(n+1)]
dp[0][0]=0
for i in range(n):
for j in range(n):
if dp[i][j]==-1:
continue
dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]+arr[i][0]*abs(arr[i][1... | 173 |
Project_CodeNet | 2,020 | n = int(input())
a = [(int(x), i) for i, x in enumerate(input().split())]
a.sort(reverse=True)
aval, ai = zip(*a)
dp = [[0] * (n+1) for _ in range(n+1)]
for l in range(n):
for r in range(n):
if l + r >= n: break
dp[l+1][r] = max(dp[l+1][r], dp[l][r] + aval[l+r] * abs(ai[l+r]-l))
dp[l][r+1] ... | 171 |
Project_CodeNet | 2,020 | N = int(input())
A = [(a, i) for i, a in enumerate(map(int, input().split()), start=1)]
A.sort(reverse=True)
dp = [[0] * (N + 1) for _ in range(N + 1)]
for s, (a, i) in enumerate(A):
for l in range(s + 1):
r = s - l
L = dp[l][r] + a * (i - (l + 1))
R = dp[l][r] + a * (N - r - i)
i... | 202 |
Project_CodeNet | 2,020 | N=int(input())
A=list(map(int,input().split()))
A=[(A[i],i) for i in range(0,N)]
A.sort(reverse=True)
dp=[[0 for i in range(0,N)] for j in range(0,N)]
for i in range(0,N-1):
a,index=A[-1]
dp[N-1][i]=a*abs(index-i)
for _ in range(1,N):
i=N-1-_
for j in range(0,i+1):
left=j
right=i-j
... | 198 |
Project_CodeNet | 2,020 | N = int(input())
A = sorted(map(lambda x: (int(x[1]), x[0]),
enumerate(input().split())), reverse=True)
V = [0]
for i in range(N-1):
a, p = A[i]
s = i+1
V2 = [None]*(s+1)
for t in range(s+1):
v = 0
if t > 0:
v = V[t-1] + a*abs(p-(t-1))
if t < s:
... | 180 |
Project_CodeNet | 2,020 | import bisect
import collections
import heapq
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
ACMOD = 1000000007
INF = 1 << 62
def lmi():
return list(map(int, input().split()))
def llmi(n):
return [lmi() for _ in range(n)]
N = int(input())
A = lmi()
AI = [(a, i) for i, a in enumerate... | 410 |
Project_CodeNet | 2,020 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, a... | 331 |
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)
#dp[i][j]:(大きい順で)i番目まで見て、左に寄せたのがj個である場合の最大値
dp = [[0 for _ in range(n+1)] for _ in range(n+1)]
for i in range(n):
x = b[i][0]
y = b[i][1]
for l in range(i+1):
r = i-l
dp[i+1][l+1] =... | 229 |
Project_CodeNet | 2,020 | # coding: utf-8
N=int(input())
A=list(map(int,input().split()))
INF=10**9
dp=[[-INF for i in range(N+1)] for j in range(N+1)]
dp[0][0]=0
AI=[]
for i in range(N):
AI.append([A[i],i+1])
AI.sort()
AI.reverse()
for i in range(1,N+1):
a=AI[i-1][0]
I=AI[i-1][1]
for j in range(N+1):
if j==0:
... | 245 |
Project_CodeNet | 2,020 | import sys
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
data = [[a,i] for i,a in enumerate(LI())]
data.sort(reverse=True)
dp = [[0] * (N+1) for _ in range(N+1)]
for i in range(N):
a, p = data[i]
for j in range(i+1):
dp[i+1][j+1] = max(d... | 167 |
Project_CodeNet | 2,020 | #!/usr/bin/env python3
import sys
def solve(N: int, A: "List[int]"):
A = sorted(enumerate(A), reverse=True, key=lambda x: x[1])
dp = [[0 for i in range(N + 1)] for j in range(N + 1)]
for i in range(N):
for j in range(0, N - i):
idx, a = A[i + j]
#idx = indices[i + j]
... | 341 |
Project_CodeNet | 2,020 | N = int(input())
A = list(map(int,input().split()))
B = [i for i in range(1,N+1)]
C = zip(A, B)
C = sorted(C, reverse = True)
A, B = zip(*C)
dp = [[0 for i in range(N+1)] for j in range(N+1)]
for i in range(N):
for j in range(i + 2):
if j == 0:
dp[0][i-j+1] = dp[0][i-j] + A[i] * (N - (i - j) - B... | 251 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.