제출 #1235932

#제출 시각아이디문제언어결과실행 시간메모리
1235932wetspongeStone Arranging 2 (JOI23_ho_t1)C++20
100 / 100
250 ms16496 KiB
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
#define mod 1000000007
using namespace std;
map <int,int> last;
int p[200001],color[200001];
int arr[200001],n; 
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>arr[i];
        last[arr[i]]=i;
    }
    for(int i=1;i<=n;i++){
        int siz=last[arr[i]]-i+1;
        while(siz--) cout<<arr[i]<<endl;
        i=last[arr[i]];
        
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...