题目
这个梅克司竟然是音译...
思路&题解:
这道题有些难度,首先枚举左端点从1到n。当l=1时,对于所有的rmex的值总共可以O(N)求,现在考虑将左端点右移时对后面mex的值的变化。显然,mex的值是单调不下降的,对于右端点r如果mex(i,r)的值是大于ai的,那么当l移到l+1时,新的mex(l,r)的值可能会变为ai,于是找到最小的r,满足mex(i,r)刚好大于ai,于是就可以在线段树上二分即可。但是不是所有的都会变,在考虑一个性质,找到下一个j使得aj==ai且j>i,那么j之前的点为右端点也有可能会变为ai,于是取交集发现这就是一个区间,发现是区间修改+区间查询,线段树即可
这道题有点卡空间,32MB....
代码
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN = 40005;
struct node{
int l , r;
ll mex , lazy , maxx;
}tre[MAXN<<2];
int n , a[MAXN] , s[MAXN];
bool flag[MAXN];
int t , zz[MAXN];
ll ans;
vector<int>G[MAXN];
inline char GetChar(){
static char buf[10001],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,10001,stdin),p1==p2)?EOF:*p1++;
}
inline void Read(int &n){
short f=1;
long long x=0;
char c=GetChar();
while(isdigit(c)==false){
if(c=='-'){
f=-1;
}
c=GetChar();
}
while(isdigit(c)==true){
x=((x<<3)+(x<<1)+(c^48));
c=GetChar();
}
n=x*f;
}
void build( int i , int l , int r ){
tre[i].l = l , tre[i].r = r;
tre[i].lazy = -1;
if( l == r ){
tre[i].mex = tre[i].maxx = s[l];
return ;
}
int mid = ( l + r ) / 2;
build( i<<1 , l , mid );
build( i<<1|1 , mid + 1 , r );
tre[i].mex = ( tre[i<<1].mex + tre[i<<1|1].mex );
tre[i].maxx = max( tre[i<<1].maxx , tre[i<<1|1].maxx );
}
void pushdown( int i ){
if( tre[i].lazy != -1 ){
tre[i<<1].lazy = tre[i<<1|1].lazy = tre[i].lazy;
tre[i<<1].maxx = tre[i<<1|1].maxx = tre[i].lazy;
tre[i<<1].mex = 1ll * tre[i<<1].lazy * ( tre[i<<1].r - tre[i<<1].l + 1 ) , tre[i<<1|1].mex = 1ll * ( tre[i<<1|1].r - tre[i<<1|1].l + 1 ) * tre[i].lazy;
tre[i].lazy = -1;
}
}
void find_( int i , int p , int &o ){
if( tre[i].l == tre[i].r ){
if( tre[i].maxx > p )
o = tre[i].l;
return ;
}
pushdown( i );
//printf( "%d %d\n" , tre[i].l , tre[i].r );
if( tre[i<<1].maxx > p )
find_( i << 1 , p , o );
else
find_( i << 1 | 1, p , o );
}
inline void modify( int i , int l , int r , int p ){
if( tre[i].l > r || tre[i].r < l ) return ;
if( l <= tre[i].l && tre[i].r <= r ){
tre[i].lazy = p;
tre[i].maxx = p;
tre[i].mex = ( tre[i].r - tre[i].l + 1 ) * p ;
return ;
}
pushdown( i );
modify( i << 1 , l , r , p );
modify( i << 1 | 1 , l , r , p );
tre[i].mex = ( tre[i<<1].mex + tre[i<<1|1].mex );
tre[i].maxx = max( tre[i<<1].maxx , tre[i<<1|1].maxx );
}
inline void query( int i , int l , int r , ll &o ){
if( tre[i].l > r || tre[i].r < l ) return ;
if( l <= tre[i].l && tre[i].r <= r ){
o += tre[i].mex;
return ;
}
pushdown( i );
query( i << 1 , l , r , o );
query( i << 1 | 1 , l , r , o );
tre[i].mex = ( tre[i<<1].mex + tre[i<<1|1].mex );
tre[i].maxx = max( tre[i<<1].maxx , tre[i<<1|1].maxx );
}
int main()
{
//freopen("Test20.in" , "r" , stdin );
//freopen( "2.out" , "w" , stdout );
Read( t );
while( t -- ){
ans = 0;
Read( n );
memset( zz , 0 , sizeof( zz ) );
for( int i = 0 ; i <= n ; i ++ )
G[i].clear();
for( int i = 1 ; i <= n ; i ++ ){
Read( a[i] );
if( a[i] > n ) a[i] = n + 1;
else G[a[i]].push_back( i );
}
int tot = 0;
memset( flag , 0 , sizeof( flag ) );
for( int i = 1 ; i <= n ; i ++ ){
if( a[i] <= n )
flag[a[i]] = 1;
while( flag[tot] ) tot ++;
s[i] = tot;
ans += tot;
}
build( 1 , 1 , n );
for( int i = 2 ; i <= n ; i ++ ){
if( a[i-1] <= n ){
zz[a[i-1]] ++;
int l , r;
if( zz[a[i-1]] >= G[a[i-1]].size() )
r = n;
else
r = G[a[i-1]][zz[a[i-1]]] - 1;
l = 0x3f3f3f3f;find_( 1 , a[i-1] , l );
if( l <= r );
modify( 1 , l , r , a[i-1] );
}
// printf( "%d:\n" , i );
ll tt = 0;
query( 1 , i , n , tt );
ans += tt;
//modify( 1 , i - 1 , i - 1 , 0 );
}
printf( "%lld\n" , ans );
}
return 0;
}