#include <bits/stdc++.h>
// cut here
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
int bsf(unsigned int n) {
#ifdef _MSC_VER
unsigned long index;
_BitScanForward(&index, n);
return index;
#else
return __builtin_ctz(n);
#endif
}
} // namespace internal
} // namespace atcoder
namespace atcoder {
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
public:
segtree() : segtree(0) {}
segtree(int n) : segtree(std::vector<S>(n, e())) {}
segtree(const std::vector<S>& v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
for (int i = 0; i < _n; i++) d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
d[p] = x;
for (int i = 1; i <= log; i++) update(p >> i);
}
S get(int p) {
assert(0 <= p && p < _n);
return d[p + size];
}
S prod(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
S sml = e(), smr = e();
l += size;
r += size;
while (l < r) {
if (l & 1) sml = op(sml, d[l++]);
if (r & 1) smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1]; }
template <bool (*f)(S)> int max_right(int l) {
return max_right(l, [](S x) { return f(x); });
}
template <class F> int max_right(int l, F f) {
assert(0 <= l && l <= _n);
assert(f(e()));
if (l == _n) return _n;
l += size;
S sm = e();
do {
while (l % 2 == 0) l >>= 1;
if (!f(op(sm, d[l]))) {
while (l < size) {
l = (2 * l);
if (f(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*f)(S)> int min_left(int r) {
return min_left(r, [](S x) { return f(x); });
}
template <class F> int min_left(int r, F f) {
assert(0 <= r && r <= _n);
assert(f(e()));
if (r == 0) return 0;
r += size;
S sm = e();
do {
r--;
while (r > 1 && (r % 2)) r >>= 1;
if (!f(op(d[r], sm))) {
while (r < size) {
r = (2 * r + 1);
if (f(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
} // namespace atcoder
// cut here
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,x,n) for(int i=x;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3HspL4A ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vec(int);
void print(){cout<<"\n";}
template<class T,class...E>
void print(const T&v,const E&...u){cout<<v<<' ',print(u...);}
// e
pii op(pii l,pii r){
if(l.fi!=r.fi) return l.se>r.se?l:r;
return l.fi>r.fi?l:r;
}
pii e(){
return {0,-1};
}
int op1(int l,int r){
return max(l,r);
}
int e1(){
return -1;
}
signed main(){
_3HspL4A;
int n;
cin>>n;
vi a(n);
rep(i,n) cin>>a[i];
vi id(n);
rep(i,n){
a[i]-=1;
id[a[i]]=i;
}
int len;
{
set<int> st;
for(auto x:a){
if(!sz(st)){
st.insert(x);
}else{
auto it=st.lower_bound(x);
if(it!=st.end()){
st.erase(it);
}
st.insert(x);
}
}
len=sz(st);
}
atcoder::segtree<pii,op,e> seg(n);
vi nxt(n);
rep(i,n){
int x=a[i];
pii val=seg.prod(0,x);
nxt[i]=val.se;
val.fi++;
val.se=x;
seg.set(x,val);
}
pii p=seg.prod(0,n);
// assert(p.fi==len);
vi layer;
int i=id[p.se];
while(1){
layer.pb(i);
if(nxt[i]==-1) break;
i=id[nxt[i]];
}
reverse(layer.begin(),layer.end());
atcoder::segtree<int,op1,e1> nseg(a);
for(auto v:layer){
nseg.set(v,-1);
}
vec(vi) pns;
pns.pb(layer);
vi qol=layer;
while(1){
layer={};
per(j,len){
if(qol[j]>=n-1) break;
bool pok=1;
while(1){
int val=nseg.prod(qol[j]+1,(j==len-1?n:qol[j+1]));
if(val==-1){
pok=0;
break;
}
nseg.set(id[val],-1);
if(!sz(layer) or a[layer.back()]>val){
layer.pb(id[val]);
qol[j]=id[val];
break;
}
}
if(!pok) break;
}
if(sz(layer)!=len) break;
reverse(layer.begin(),layer.end());
pns.pb(layer);
}
print(sz(pns),len);
for(auto ids:pns){
for(auto v:ids) cout<<v+1<<" ";
print();
}
//
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Subsequence indices should be sorted |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Subsequence indices should be sorted |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Subsequence indices should be sorted |
| 2 |
Halted |
0 ms |
0 KB |
- |
