| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1145525 | ezzzay | Stone Arranging 2 (JOI23_ho_t1) | C++20 | 329 ms | 16524 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb puhs_back
const int N=3e5+5;
int a[N];
signed main(){
int n;
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
map<int,int>mp;
for(int i=1;i<=n;i++){
mp[a[i]]=max(mp[a[i]],i);
}
int l=1;
while(l<=n){
for(int i=l;i<=mp[a[l]];i++)a[i]=a[l];
l=mp[a[l]]+1;
}
for(int i=1;i<=n;i++){
cout<<a[i]<<endl;
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
