Submission #774639

#	Time	Username	Problem	Language	Result	Execution time	Memory
774639		giaminh2211	Financial Report (JOI21_financial)	C++14	0 / 100	25 ms	13888 KiB

Main

#include<bits/stdc++.h>
#define fn(n) for(int i=1; i<=n; i++)

using namespace std;
using ll=long long;

int n;
int a[200002];
vector<int> pos[200002];

void nhap(){
    cin >> n;
    for(int i=1; i<=n; i++){
        cin >> a[i];
    }
}

void solve(){
    for(int i=1; i<=n; i++){
    	if(pos[a[i]].size()!=0){
    		for(int j=i-1; j>pos[a[i]].back(); j--){
	            a[j]=a[i];
	            if(pos[j].size() && j==pos[j].back()){
	            	pos[j].pop_back();
	            }
	        }	
    	}
        pos[a[i]].push_back(i);
    }
    for(int i=1; i<=n; i++){
        cout << a[i] << ' ';
    }
    cout << '\n';
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    nhap();
    solve();
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35