[백준 2493번] 탑

소스코드

---

#include <iostream>
using namespace std;
 
int main() {
    int n,building[500001],result[500001];
    int Max=0, Max_idx=0, Mid=0, Mid_idx=0;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> building[i];
    }
 
    for (int i = 1; i <= n; i++) {
        if (building[i] > Max) {
            result[i] = 0;
            Max = building[i];
            Max_idx = i;
        }
        else if (building[i]<Max && Mid < building[i]) {
            result[i] = Max_idx;
            Mid = building[i];
            Mid_idx = i;
        }
        else if (building[i] < Mid) {
            for (int j = i; j >= Mid_idx; j--) {
                if (building[i] < building[j]){
                    result[i] = j;
                    break;
                }
            }
 
        }
    }
    for (int i = 1; i <= n; i++) {
        cout << result[i] << " ";
    }
    return 0;
}