#include <stdio.h>
int main(void) {
int N[10], P[10];
int Top;
int num, i, prv, cur;
Top = -1;
/* 配列初期化 */
for (i = 0; i < 10; i++) {
N[i] = -1;
P[i] = -1;
}
i = 0;
while (num != -1 && i < 10) {
N[i] = num;
prv = -1;
cur = Top;
/* 大きい順になる位置を探す */
while (cur != -1 && (N[i] > N[cur])) {
prv = cur;
cur = P[cur];
}
P[i] = cur;
if (prv != -1) {
P[prv] = i;
} else {
Top = i;
}
i++;
}
/* 表示 */
cur = Top;
while (cur != -1) {
cur = P[cur];
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbih2b2lkKSB7CiAgICBpbnQgTlsxMF0sIFBbMTBdOwogICAgaW50IFRvcDsKICAgIGludCBudW0sIGksIHBydiwgY3VyOwoKICAgIFRvcCA9IC0xOwoKICAgIC8qIOmFjeWIl+WIneacn+WMliAqLwogICAgZm9yIChpID0gMDsgaSA8IDEwOyBpKyspIHsKICAgICAgICBOW2ldID0gLTE7CiAgICAgICAgUFtpXSA9IC0xOwogICAgfQoKICAgIGkgPSAwOwoKICAgIHByaW50Zigi5pWw5YCk44KS5YWl5YqbICgtMeOBp+e1guS6hik6ICIpOwogICAgc2NhbmYoIiVkIiwgJm51bSk7CgogICAgd2hpbGUgKG51bSAhPSAtMSAmJiBpIDwgMTApIHsKCiAgICAgICAgTltpXSA9IG51bTsKCiAgICAgICAgcHJ2ID0gLTE7CiAgICAgICAgY3VyID0gVG9wOwoKICAgICAgICAvKiDlpKfjgY3jgYTpoIbjgavjgarjgovkvY3nva7jgpLmjqLjgZkgKi8KICAgICAgICB3aGlsZSAoY3VyICE9IC0xICYmIChOW2ldID4gTltjdXJdKSkgewogICAgICAgICAgICBwcnYgPSBjdXI7CiAgICAgICAgICAgIGN1ciA9IFBbY3VyXTsKICAgICAgICB9CgogICAgICAgIFBbaV0gPSBjdXI7CgogICAgICAgIGlmIChwcnYgIT0gLTEpIHsKICAgICAgICAgICAgUFtwcnZdID0gaTsKICAgICAgICB9IGVsc2UgewogICAgICAgICAgICBUb3AgPSBpOwogICAgICAgIH0KCiAgICAgICAgaSsrOwoKICAgICAgICBwcmludGYoIuaVsOWApOOCkuWFpeWKmyAoLTHjgafntYLkuoYpOiAiKTsKICAgICAgICBzY2FuZigiJWQiLCAmbnVtKTsKICAgIH0KCiAgICAvKiDooajnpLogKi8KICAgIGN1ciA9IFRvcDsKCiAgICBwcmludGYoIuS4puOBs+abv+OBiOe1kOaenDpcbiIpOwoKICAgIHdoaWxlIChjdXIgIT0gLTEpIHsKICAgICAgICBwcmludGYoIiVkXG4iLCBOW2N1cl0pOwogICAgICAgIGN1ciA9IFBbY3VyXTsKICAgIH0KCiAgICByZXR1cm4gMDsKfQ==