結果
問題 | No.318 学学学学学 |
ユーザー |
![]() |
提出日時 | 2020-08-26 18:28:03 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 148 ms / 2,000 ms |
コード長 | 4,650 bytes |
コンパイル時間 | 1,809 ms |
コンパイル使用メモリ | 126,300 KB |
実行使用メモリ | 11,896 KB |
最終ジャッジ日時 | 2024-11-07 13:16:48 |
合計ジャッジ時間 | 7,028 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<utility>#include<cassert>#include<complex>#include<numeric>#include<array>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef long double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acosl(-1.0);ll mod_pow(ll x, ll n, ll m) {ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n % mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }const int max_n = 1 << 1;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}ll gcd(ll a, ll b) {if (a < b)swap(a, b);while (b) {ll r = a % b; a = b; b = r;}return a;}struct SegT {private:int n; vector<int> node, lazy;const int init_c = 0;public:SegT(vector<int> v) {int sz = v.size();n = 1;while (n < sz)n <<= 1;node.resize(2 * n - 1, init_c);lazy.resize(2 * n - 1, -1);rep(i, sz) {node[i + n - 1] = v[i];}}int f(int a, int b) {return max(a, b);}void eval(int k, int l, int r) {if (lazy[k] < 0)return;node[k] = lazy[k];if (r - l > 1) {lazy[2 * k + 1] = lazy[k];lazy[2 * k + 2] = lazy[k];}lazy[k] = -1;}void add(ll x, int a, int b, int k = 0, int l = 0, int r = -1) {if (r < 0)r = n;eval(k, l, r);if (r <= a || b <= l)return;if (a <= l && r <= b) {lazy[k] = x; eval(k, l, r);}else {add(x, a, b, k * 2 + 1, l, (l + r) / 2);add(x, a, b, k * 2 + 2, (l + r) / 2, r);node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);}}int query(int a, int b, int k = 0, int l = 0, int r = -1) {if (r < 0)r = n;eval(k, l, r);if (r <= a || b <= l)return init_c;if (a <= l && r <= b)return node[k];else {int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);return f(vl, vr);}}};void solve() {int n; cin >> n;vector<int> a(n);rep(i, n)cin >> a[i];vector<int> cop = a; sort(all(cop)); cop.erase(unique(all(cop)), cop.end());rep(i, n) {a[i] = lower_bound(all(cop), a[i]) - cop.begin();}SegT st(a);vector<vector<int>> loc(cop.size());rep(i, n)loc[a[i]].push_back(i);rep(i, cop.size()) {vector<int> vs;for (int id : loc[i]) {vs.push_back(id);st.add(i, id, id + 1);}rep(j, (int)vs.size() - 1) {int l = vs[j], r = vs[j + 1];st.add(i, l, r);}}vector<int> b(n);rep(i, n)b[i] = st.query(i, i + 1);rep(i, n) {if (i > 0)cout << " ";cout << cop[b[i]];}cout << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(15);//init_f();//expr();//int t; cin >> t; rep(i, t)solve();return 0;}