1707B - Difference Array - CodeForces Solution


brute force data structures implementation sortings *1900

Please click on ads to support us..

Python Code:

from bisect import bisect as b
for _ in range(int(input())):
    n=int(input())
    l=list(map(int,input().split()))
    for j in range(1,n):
        k=[]
        for i in range(1,len(l)):
            k.append(l[i]-l[i-1])
        k.sort()
        l=k[b(k,0):]
        if len(l)<n-j:
            l.insert(0,0)
    if len(l)==1:
        print(l[0])


Comments

Submit
0 Comments
More Questions

903C - Boxes Packing
887A - Div 64
755B - PolandBall and Game
808B - Average Sleep Time
1515E - Phoenix and Computers
1552B - Running for Gold
994A - Fingerprints
1221C - Perfect Team
1709C - Recover an RBS
378A - Playing with Dice
248B - Chilly Willy
1709B - Also Try Minecraft
1418A - Buying Torches
131C - The World is a Theatre
1696A - NIT orz
1178D - Prime Graph
1711D - Rain
534A - Exam
1472A - Cards for Friends
315A - Sereja and Bottles
1697C - awoo's Favorite Problem
165A - Supercentral Point
1493A - Anti-knapsack
1493B - Planet Lapituletti
747B - Mammoth's Genome Decoding
1591C - Minimize Distance
1182B - Plus from Picture
1674B - Dictionary
1426C - Increase and Copy
520C - DNA Alignment