제출 #1007439

#제출 시각아이디문제언어결과실행 시간메모리
1007439AtinaRStone Arranging 2 (JOI23_ho_t1)C++14
100 / 100
384 ms14508 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin>>n;
    int niza[n];
    for(int i=0; i<n; i++)
    {
        cin>>niza[i];
    }
    map<int,int> last;
    for(int i=0; i<n; i++)
    {
        last[niza[i]]=i;
    }
    int i=0;
    while(i<n)
    {
        int next=last[niza[i]];
        int val=niza[i];
        while(i<=next)
        {
            cout<<val<<endl;
            i++;
        }
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...