Comparar texto

Encuentra la diferencia entre dos archivos de texto

Editor live

Ocultar sin cambios

Sin ajuste de línea

Vista

Nivel de detalle

Resaltado de sintaxis

Diffchecker Desktop La forma más segura de usar Diffchecker. ¡Obtén la app de Diffchecker Desktop: tus diffs nunca salen de tu computadora!Obtener Desktop

First and last submission

Creado hace 4 añosEl diff nunca expira

17 eliminaciones

Líneas
Total
Eliminado

Caracteres
Total
Eliminado

Para continuar usando esta función, actualice a Diffchecker Pro Ver precios

69 líneas

8 adiciones

Líneas
Total
Añadido

Caracteres
Total
Añadido

Para continuar usando esta función, actualice a Diffchecker Pro Ver precios

63 líneas

# https://www.codechef.com/viewsolution/60594129

# https://www.codechef.com/viewsolution/60638735

# cook your dish here

import sys,os,io

import math

from collections import defaultdict

def ii():

return int(input())

def li():

return list(map(int,input().split()))

if(os.path.exists('input.txt')):

sys.stdin = open("input.txt","r") ; sys.stdout = open("output.txt","w")

else:

input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

import bisect

def lengthOfLIS(nums):

x = []

temp = [0]*(len(nums))

for i in range(len(nums)):

if not x:

x.append(nums[i])

temp[i]=len(x)

continue

ind = bisect.bisect_left(x,nums[i])

# replace bisect_left by bisect_right for longes non-dec subsequence

if ind==len(x):

x.append(nums[i])

else:

x[ind]=nums[i]

temp[i]=len(x)

return temp

def lengthOfLDS(nums):

x = []

temp = [0]*(len(nums))

for i in range(len(nums)):

if not x:

x.append(nums[i])

temp[i]=len(x)

continue

ind = bisect.bisect_left(x,nums[i])

# replace bisect_left by bisect_right for longes non-dec subsequence

if ind==len(x):

x.append(nums[i])

else:

x[ind]=nums[i]

temp[i]=len(x)

return temp[::-1]

def solve():

n = ii()

n = int(input())

l = li()

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

a = lengthOfLIS(l)

for i in range(n):

l[i]=-l[i]

l = l[::-1]

b = lengthOfLDS(l)

ans = 0

for i in range(n-1):

ans=max(ans,a[i]+b[i+1])

print(ans)

t = 1

t = ii()

t = int(input())

for _ in range(t):

for i in range(t):

solve()

Diferencias guardadas

Texto original

Abrir archivo

# https://www.codechef.com/viewsolution/60594129

# cook your dish here
import sys,os,io
import math 
from collections import defaultdict
def ii():
    return int(input())
def li():
    return list(map(int,input().split()))
if(os.path.exists('input.txt')):
    sys.stdin = open("input.txt","r") ; sys.stdout = open("output.txt","w") 
else:
    input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

import bisect
def lengthOfLIS(nums):
    x = []
    temp = [0]*(len(nums))
    for i in range(len(nums)):
        if not x:
            x.append(nums[i])
            temp[i]=len(x)
            continue 
        ind = bisect.bisect_left(x,nums[i])
        # replace bisect_left by bisect_right for longes non-dec subsequence
        if ind==len(x):
            x.append(nums[i])
        else:
            x[ind]=nums[i]
        temp[i]=len(x)
    return temp

def lengthOfLDS(nums):
    x = []
    temp = [0]*(len(nums))
    for i in range(len(nums)):
        if not x:
            x.append(nums[i])
            temp[i]=len(x)
            continue 
        ind = bisect.bisect_left(x,nums[i])
        # replace bisect_left by bisect_right for longes non-dec subsequence
        if ind==len(x):
            x.append(nums[i])
        else:
            x[ind]=nums[i]
        temp[i]=len(x)
    return temp[::-1]

def solve():
    n = ii()
    l = li()
    a = lengthOfLIS(l)
    for i in range(n):
        l[i]=-l[i]
    l = l[::-1]
    b = lengthOfLDS(l)
    ans = 0
    for i in range(n-1):
        ans=max(ans,a[i]+b[i+1])
    print(ans)

t = 1
t = ii()
for _ in range(t):
    solve()

Texto modificado

Abrir archivo

# https://www.codechef.com/viewsolution/60638735

import sys,os,io
import math 
from collections import defaultdict

import bisect
def lengthOfLIS(nums):
    x = []
    temp = [0]*(len(nums))
    for i in range(len(nums)):
        if not x:
            x.append(nums[i])
            temp[i]=len(x)
            continue 
        ind = bisect.bisect_left(x,nums[i])
       
        if ind==len(x):
            x.append(nums[i])
        else:
            x[ind]=nums[i]
        temp[i]=len(x)
    return temp

def lengthOfLDS(nums):
    x = []
    temp = [0]*(len(nums))
    for i in range(len(nums)):
        if not x:
            x.append(nums[i])
            temp[i]=len(x)
            continue 
        ind = bisect.bisect_left(x,nums[i])
        
        if ind==len(x):
            x.append(nums[i])
        else:
            x[ind]=nums[i]
        temp[i]=len(x)
    return temp[::-1]

def solve():
    n = int(input())
    l = list(map(int,input().split()))
    a = lengthOfLIS(l)
    for i in range(n):
        l[i]=-l[i]
    l = l[::-1]
    b = lengthOfLDS(l)
    ans = 0
    for i in range(n-1):
        ans=max(ans,a[i]+b[i+1])
    print(ans)

t = int(input())
for i in range(t):
    solve()