Problem:
Score : 300 points

Problem Statement

You are given a sequence of length N: A_1, A_2, ..., A_N.
For each integer i between 1 and N (inclusive), answer the following question:

Find the maximum value among the N-1 elements other than A_i in the sequence.

Constraints

2 \leq N \leq 200000

1 \leq A_i \leq 200000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1
:
A_N

Output

Print N lines. The i-th line (1 \leq i \leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.

Sample Input 1

3
1
4
3

Sample Output 1

4
3
4

The maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.

The maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.

The maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.

Sample Input 2

2
5
5

Sample Output 2

5
5

Solution in Go (1.6) (judge verdict: Accepted)

package main

import (
        "fmt"
)

func solution(n int, a []int) []int {
        var memo [200001]int
        first, second := 0, 0
        for i := 0; i < n; i++ {
                memo[a[i]]++
                first = max(first, a[i])
        }

        for i := first - 1; i >= 0; i-- {
                if memo[i] > 0 {
                        second = i
                        break
                }
        }

        out := make([]int, 0, n)
        for i := 0; i < n; i++ {
                switch {
                case a[i] == first && memo[first] > 1:
                        out = append(out, first)
                case a[i] == first && memo[first] == 1:
                        out = append(out, second)
                default:
                        out = append(out, first)
                }
        }
        return out
}

func max(x, y int) int {
        if x > y {
                return x
        }
        return y
}

func main() {
        var n int
        fmt.Scan(&n)
        a := make([]int, 0, n)
        for i := 0; i < n; i++ {
                t := 0
                fmt.Scan(&t)
                a = append(a, t)
        }
        for _, v := range solution(n, a) {
                fmt.Println(v)
        }
}