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"
//import "math"

func main(){
	var N int
	var A [200000]float64
	var maxtmp, max float64
	var maxIndex int

	fmt.Scan(&N)
	for i:= 0 ; i < N ; i++ {
		fmt.Scan(&A[i])
	}
	
	maxtmp = 0
	for i := 0 ; i < N ; i++ {
		if maxtmp < A[i]{
			maxtmp = A[i]
			maxIndex = i
		}
	}
	max = maxtmp
	maxtmp = 0
	if maxIndex == 0 {
		for j := 1 ; j < N ; j++{
			if maxtmp < A[j] {
				maxtmp = A[j]
			}
		}
	}else if maxIndex == N - 1{
		for j := 0 ; j < N - 1 ; j++{
			if maxtmp < A[j] {
				maxtmp = A[j]
			}
		}
	}else {
		for j := 0 ; j < maxIndex - 1 ; j++{
			if maxtmp < A[j]{
				maxtmp = A[j]
			}
		}
		for j := maxIndex + 1 ; j < N ; j++{
			if maxtmp < A[j] {
				maxtmp = A[j]
			}
		}
	}
	for i := 0 ; i < N ; i++ {
		if i == maxIndex {
			fmt.Println(maxtmp)
		}else{
			fmt.Println(max)
		}
	}

		/*if i == 0 {
			for j := 1 ; j < N ;j++{
				if maxtmp < A[j]{
					maxtmp = A[j]
				}
			}
		}else if i == N - 1{
			for j := 0 ; j < N - 1 ; j++{
				if maxtmp < A[j]{
					maxtmp = A[j]
				}
			}
		}else{
			for j := 0 ; j < i - 1 ; j++{
				if maxtmp < A[j]{
					maxtmp = A[j]
				}
			}
			for j := i + 1 ; j < N ; j++{
				if maxtmp < A[j] {
					maxtmp = A[j]
				}
			}
		}*/

		
	
}