テキスト比較

2 つのテキストファイルの違いを見つける

ライブエディター

未変更行を折りたたむ

折り返しなし

レイアウト

比較精度

シンタックスハイライト

Diffchecker Desktop Diffcheckerを実行する最も安全な方法。Diffchecker Desktopアプリを入手：あなたの差分はコンピューターから出ることはありません！Desktopを入手

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