【Codeforces 145 E. Lucky Queries】

CF145E
题意 给你一个字符串 由 4 7 组成
问你区间最长Lis
但是可以区间取反( 4 - > 7, 7 - > 4)
做法 我们维护区间Lis 因为他只有 4 7
所以我们这样想 区间Lis 只能是 左边升 + 右边 7
左边 4 + 右边升
左边 4 + 右边 7
取maxx
降序同理
我们只要每次维护 Four(4个数
Seven(7个数
Up(最长不下降长度
Down(最长不上升长度

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 1000025;
char str[MAX_N];
int col[MAX_N<<2],Up[MAX_N<<2],Down[MAX_N<<2],Four[MAX_N<<2],Seven[MAX_N<<2];
void up(int rt)
{
    Four[rt] = Four[rt<<1] + Four[rt<<1|1];
    Seven[rt] = Seven[rt<<1] + Seven[rt<<1|1];
    Up[rt] = max(Four[rt<<1]+Seven[rt<<1|1],max(Up[rt<<1]+Seven[rt<<1|1],Four[rt<<1]+Up[rt<<1|1]));
    Down[rt] = max(Seven[rt<<1]+Four[rt<<1|1],max(Down[rt<<1]+Four[rt<<1|1],Seven[rt<<1]+Down[rt<<1|1]));
}
void down(int rt)
{
    if(col[rt])
    {
        col[rt<<1] = !col[rt<<1];
        col[rt<<1|1] = !col[rt<<1|1];
        swap(Four[rt<<1],Seven[rt<<1]);
        swap(Four[rt<<1|1],Seven[rt<<1|1]);
        swap(Up[rt<<1],Down[rt<<1]);
        swap(Up[rt<<1|1],Down[rt<<1|1]);
        col[rt] = 0;
    }
}
void build(int rt,int l,int r)
{
    col[rt] = Four[rt] = Seven[rt] = Up[rt] = Down[rt] = 0;
    if(l==r)
    {
        Up[rt] = Down[rt] = 1;
        Four[rt] = (str[l]=='4');
        Seven[rt] = (!Four[rt]);
        return ;
    }
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    up(rt);
}
void update(int rt,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)
    {
        col[rt]=!col[rt];
        swap(Four[rt],Seven[rt]);
        swap(Up[rt],Down[rt]);
        return;
    }
    down(rt);
    if(y<=mid) update(rt<<1,l,mid,x,y);
    else if(x>mid) update(rt<<1|1,mid+1,r,x,y);
    else update(rt<<1,l,mid,x,y),update(rt<<1|1,mid+1,r,x,y);
    up(rt);
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,Q,x,y;
    char opt[10];
    scanf("%d%d",&n,&Q);
    scanf("%s",str+1);
    build(1,1,n);
    while(Q--)
    {
        scanf("%s",opt);
        if(opt[0]=='c')
        {
            printf("%d\n",Up[1]);
        }
        else
        {
            scanf("%d%d",&x,&y);
            update(1,1,n,x,y);
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}