텍스트 비교

두 텍스트 파일의 차이점을 찾아보세요

실시간 편집

변경 없는 행 숨기기

줄바꿈 비활성화

레이아웃

비교 단위

구문 강조

Diffchecker Desktop 가장 안전하게 Diffchecker를 사용하는 방법. 데스크톱 앱을 사용하면 비교 데이터가 외부로 전송되지 않습니다!데스크톱 앱 받기

First and last submission

생성일 4년 전비교 결과 만료 없음

17 삭제

행
총
삭제

글자
총
삭제

이 기능을 계속 사용하려면 업그레이드해 주세요 Diffchecker Pro 요금제 보기

69 행

8 추가

행
총
추가

글자
총
추가

이 기능을 계속 사용하려면 업그레이드해 주세요 Diffchecker Pro 요금제 보기

63 행

# 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()

저장된 비교 결과

원본

파일 열기

# 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()

수정본

파일 열기

# 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()