oj.uz

Submission #632801

# Submission time Handle Problem Language Result Execution time Memory
632801 2022-08-20T20:23:16 Z beaconmc Global Warming (CEOI18_glo) PyPy 3
0 / 100
 178 ms 46132 KB 
from bisect import *

n,x = map(int, input().split())

arr = list(map(int, input().split()))


sussy2 = [0 for i in range(n)]
sussy = [0 for i in range(n)]

def LIS(lis):
    dp = []
    cur = n-1
    for i in lis:
        sus = bisect_left(dp,i)
        if sus==len(dp):
            dp.append(i)
        else:
            dp[sus] = i
        sussy2[cur] = len(dp)
        cur-=1

    return len(dp)

def LIS2(lis):
    dp = []
    cur = 0
    for i in lis:
        sus = bisect_left(dp,i)
        if sus==len(dp):
            dp.append(i)
        else:
            dp[sus] = i
        sussy[cur] = len(dp)
        cur+=1

    return len(dp)
LIS2(arr)
LIS([-i for i in arr])
ans = 0

for i in range(n-1):
    ans = max(ans, sussy[i]+sussy2[i+1])

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 18160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 18160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 18160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 178 ms 46132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 94 ms 26404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 119 ms 31096 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 18160 KB Output isn't correct
2 Halted 0 ms 0 KB -