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 C (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include<stdio.h>

int main(){
    int N, i, j;
    int A[200000];
    int mem[200000];
    int tmp;

    scanf("%d", &N);
    for (i = 0; i < N;i++){
        scanf("%d", &A[i]);
        mem[i] = 0;
    }

    for (i = 0;i<N;i++){
        tmp = 0;
        if(i==1&&mem[0]!=A[i]){
            mem[i] = mem[0];
            continue;
        }
        else if(i>1&&mem[i-1]!=A[i]){
            if(A[i-1] != mem[i-2]){
                mem[i] = mem[i - 1];
            }
            else{
                mem[i] = mem[i - 2];
            }
            continue;
        }
        if(i == 0){
            tmp = A[1];
        }
        else{
            tmp = A[0];
        }
        for (j = 0; j < N; j++){
            if(j!=i){
                if(tmp<A[j]){
                    tmp = A[j];
                }
            }
        }
        mem[i] = tmp;
    }
    for (i = 0; i < N;i++){
        printf("%d\n", mem[i]);
    }
    return 0;
}