1991A - Maximize the Last Element - CodeForces Solution


greedy implementation

Please click on ads to support us..

Python Code:

import io,os

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

t = int(input())

def inp():
    return int(input())
def inlt():
    return list(map(int,input().split()))
def instr():
    return list(input())

for _ in range(t):
    n = inp()
    a = inlt()

    maxe = 0
    for i in range(0,len(a),2):
        maxe = max(maxe,a[i])
    
    print(maxe)


Comments

Submit
0 Comments
More Questions

1455B - Jumps
1225C - p-binary
1525D - Armchairs
1257A - Two Rival Students
1415A - Prison Break
1271A - Suits
259B - Little Elephant and Magic Square
1389A - LCM Problem
778A - String Game
1382A - Common Subsequence
1512D - Corrupted Array
667B - Coat of Anticubism
284B - Cows and Poker Game
1666D - Deletive Editing
1433D - Districts Connection
2B - The least round way
1324A - Yet Another Tetris Problem
246B - Increase and Decrease
22E - Scheme
1566A - Median Maximization
1278A - Shuffle Hashing
1666F - Fancy Stack
1354A - Alarm Clock
1543B - Customising the Track
1337A - Ichihime and Triangle
1366A - Shovels and Swords
919A - Supermarket
630C - Lucky Numbers
1208B - Uniqueness
1384A - Common Prefixes