Submission #5641905


Source Code Expand

# まず取り出しきっちゃってから捨てる
# 左右からいくつずつ取り出すか

N,K = map(int,input().split())
V = [int(x) for x in input().split()]

max_value = 0 # 何もとらない

for L in range(N):
  for R in range(N):
    if L+R > K:
      break
    if L+R > N:
      break
    #get = V[:L] + V[-R:]
    get = V[:L]
    if R > 0:
      get += V[-R:]
    get.sort()
    rest = K - (L+R)
    minus = sum((1 if x < 0 else 0 for x in get))
    if minus > rest:
      value = sum(get[rest:])
    else:
      value = sum((x for x in get if x > 0))
    if value > max_value:
      max_value = value
    #print(L,R,rest,get,value)
      
      
   
print(max_value)
    

Submission Info

Submission Time
Task D - equeue
User maspy
Language Python (3.4.3)
Score 0
Code Size 722 Byte
Status WA
Exec Time 27 ms
Memory 3064 KiB

Judge Result

Set Name All Sample
Score / Max Score 0 / 400 0 / 0
Status
AC × 21
WA × 2
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15, testcase_16, testcase_17, testcase_18, testcase_19, testcase_20
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 17 ms 3064 KiB
sample_02 AC 17 ms 3064 KiB
sample_03 AC 17 ms 3064 KiB
testcase_01 AC 18 ms 3064 KiB
testcase_02 AC 18 ms 3064 KiB
testcase_03 AC 18 ms 3064 KiB
testcase_04 AC 27 ms 3064 KiB
testcase_05 AC 27 ms 3064 KiB
testcase_06 AC 25 ms 3064 KiB
testcase_07 AC 24 ms 3064 KiB
testcase_08 AC 17 ms 3064 KiB
testcase_09 AC 21 ms 3064 KiB
testcase_10 AC 18 ms 3064 KiB
testcase_11 AC 18 ms 3064 KiB
testcase_12 AC 18 ms 3064 KiB
testcase_13 AC 17 ms 3064 KiB
testcase_14 AC 19 ms 3064 KiB
testcase_15 AC 18 ms 3064 KiB
testcase_16 AC 20 ms 3064 KiB
testcase_17 AC 22 ms 3064 KiB
testcase_18 WA 17 ms 3064 KiB
testcase_19 WA 17 ms 3064 KiB
testcase_20 AC 17 ms 3064 KiB