Submission #774740

#TimeUsernameProblemLanguageResultExecution timeMemory
774740ngungunguStone Arranging 2 (JOI23_ho_t1)C++17
25 / 100
3 ms596 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e4 + 5;
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int n;
	cin >> n;
	int a[maxn];
	map<int, int> d;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
	}
	for (int i = 1; i <= n; i++){
		d[a[i]] = i;
	}
	int check;
	for (int i = 1; i <= n; i++){
		check = d[a[i]];
		for (int j = 1; j <= check - i + 1; j++){
			cout << a[i] << endl;
		}
		i = check;
	}
	
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...