1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T503,#include #include #include #include #include #define FOR(i, a, b) for (int i = (a); i < (b); ++i) using namespace std; template using Vec = vector; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, an, prev = 0; cin >> n; an = n; stack oks; stack oks_tmp; vector output(n); int num; FOR(i, 0, n) { cin >> num; oks.push(num); } while (true) { if (oks.empty()) break; int tmp = oks.top(); oks.pop(); if (prev) { if (prev > tmp) { output[--an] = prev; oks_tmp.push(prev); } else if(oks_tmp.empty()){ output[--an] = -1; } else { int top = oks_tmp.top(); if (top > tmp) output[--an] = top; else if (oks_tmp.size()>1){ stack storage; storage = oks_tmp; int flag = 0; while (true) { oks_tmp.pop(); if (oks_tmp.empty()) break; top = oks_tmp.top();

제출 #66681

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: