#include<bits/stdc++.h>
#include "sequence.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"
// ==========================(debug)============================================================================================== //
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif
void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// ==========================(debug)============================================================================================== //
ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;
// ==========================(MOD)=============================================================================================== //
ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }
// ==========================(MOD)=============================================================================================== //
bool f = false;
ll a[mx];
vi lis[mx];
ll pref[mx];
typedef struct SEGMENT_TREE{
vi men,mex,laz;
ll range;
void init(ll k){
range = 4 * k;
men.resize(range);
mex.resize(range);
laz.resize(range);
fip(0,n)
men[i] = mex[i] = laz[i] = 0;
return;
}
void prop(ll ptr,ll l,ll r){
mex[ptr] += laz[ptr];
men[ptr] += laz[ptr];
if(l!=r){
laz[2*ptr] += laz[ptr];
laz[2*ptr+1] += laz[ptr];
}
laz[ptr] = 0;
return;
}
void update(ll ptr,ll l,ll r,ll st,ll en,ll val){
prop(ptr,l,r);
if(l>en || r<st)
return;
if(l>=st && r<=en){
laz[ptr] += val;
prop(ptr,l,r);
return;
}
ll mid = l + (r-l) / 2;
update(2*ptr,l,mid,st,en,val);
update(2*ptr+1,mid+1,r,st,en,val);
men[ptr] = min(men[2*ptr],men[2*ptr+1]);
mex[ptr] = max(mex[2*ptr],mex[2*ptr+1]);
return;
}
ll query_mn(ll ptr,ll l,ll r,ll st,ll en){
prop(ptr,l,r);
if(r<l)
return 1e18;
if(l>en || r<st)
return 1e18;
if(l>=st && r<=en){
return men[ptr];
}
ll mid = l + (r-l) / 2;
return min(query_mn(2*ptr,l,mid,st,en),query_mn(2*ptr+1,mid+1,r,st,en));
}
ll query_mx(ll ptr,ll l,ll r,ll st,ll en){
prop(ptr,l,r);
if(r<l)
return -1e18;
if(l>en || r<st)
return -1e18;
if(l>=st && r<=en){
return mex[ptr];
}
ll mid = l + (r-l) / 2;
return max(query_mx(2*ptr,l,mid,st,en),query_mx(2*ptr+1,mid+1,r,st,en));
}
}SGT;
SGT st1,st2;
int sequence(int N, vector<int> A) {
n = N;
fip(0,n){
a[i] = A[i];
lis[a[i]].push_back(i);
}
ans = 1;
st1.init(n);
st2.init(n);
fip(0,n){
st1.update(1,0,n-1,i,n-1,1);
st2.update(1,0,n-1,i,n-1,1);
}
fip(1,n+1){
fx(lis[i]){
st1.update(1,0,n-1,x,n-1,-2);
}
if((ll)lis[i].size() > 1){
tp = lis[i][0];
tp2 = lis[i][1];
sum = st2.query_mx(1,0,n-1,tp2,n-1) - min(0ll,st2.query_mn(1,0,n-1,0,tp-1));
res = st1.query_mn(1,0,n-1,tp2,n-1) - max(0ll,st1.query_mx(1,0,n-1,0,tp-1));
if(sum>=0 && res<=0)
ans = max(ans,2ll);
}
fx(lis[i])
st2.update(1,0,n-1,x,n-1,-2);
}
return ans;
}
// int main(){
// ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input1.txt", "r", stdin);
// freopen("output1.txt", "w", stdout);
// freopen("error1.txt", "w", stderr);
// #endif // ONLINE_JUDGE
// int N;
// cin>>N;
// vector<int> A(N);
// for( auto &x : A)
// cin>>x;
// cout<<sequence(N,A);
// cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
// return 0;
// }
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
14684 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
14776 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
14684 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
14776 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
14684 KB |
Output is correct |
| 2 |
Incorrect |
897 ms |
126236 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
14776 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
928 ms |
131308 KB |
Output is correct |
| 2 |
Correct |
934 ms |
131280 KB |
Output is correct |
| 3 |
Correct |
900 ms |
130568 KB |
Output is correct |
| 4 |
Correct |
890 ms |
130728 KB |
Output is correct |
| 5 |
Correct |
878 ms |
127396 KB |
Output is correct |
| 6 |
Correct |
923 ms |
130596 KB |
Output is correct |
| 7 |
Correct |
875 ms |
129628 KB |
Output is correct |
| 8 |
Correct |
855 ms |
129112 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
14684 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
14776 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
14684 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
14776 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
