刚学OI 求救 odt写炸了

蜜汁RE*8（刚学的odt）

#include<bits/stdc++.h>
using namespace std;

struct node{
    int l, r; mutable bool val;
    node( int L, int R = -1, int v = 0 ):l(L), r(R), val(v){}
    bool operator < ( const node t )const{ return l < t.l; }
};

#define IT set<node>::iterator
set<node> S;

void print(){
    for ( IT i = S.begin(); i != S.end(); ++i ) printf( "%d  %d  %d\n", i->l, i->r, i->val );
}

inline IT Split( int pos ){
    IT t(S.lower_bound(node(pos)));
    if ( t != S.end() && t->l == pos ) return t;
    t--;
    int L(t->l), R(t->r); bool v(t->val);
    S.erase(t);
    S.insert( node( L, pos - 1, v ) );
    return S.insert( node( pos, R, v ) ).first;
}

inline void Assign( int L, int R, bool v ){
    IT it1(Split(L)), it2(Split(R + 1));
    S.erase( it1, it2 );
    S.insert(node( L, R, v ));
}

inline void Change( int l, int r ){
    IT be(Split(l)), ed(Split(r + 1));
    for ( IT it = be; it != ed; ++it ) it->val = !(it->val);
}

inline int Get1( int l, int r ){
    IT be(Split(l)), ed(Split(r + 1)); int ans(0);
    for ( IT it = be; it != ed; ++it ) if ( it->val ) ans += (it->r) - (it->l) + 1;
    return ans;
}

inline int Get2( int l, int r ){
    IT be(Split(l)), ed(Split(r + 1)); int ans(0), cur(0);
    for ( IT it = be; it != ed; ++it )
        if ( it->val ) cur += (it->r) - (it->l) + 1;
        else ans = max( ans, cur ), cur = 0;
    ans = max( ans, cur );
    return ans;
}

int N, M, t, ls;
int a[100005];

int main(){
    scanf( "%d%d", &N, &M ); ls = 1;
    for ( int i = 1; i <= N; ++i ) scanf( "%d", &a[i] );
    for ( int i = 2; i <= N; ++i ) if ( a[i] ^ a[i - 1] ) S.insert( node( ls, i - 1, a[i - 1] ) ), ls = i;
    S.insert( node( ls, N, a[N] ) ); 
    for ( int i = 1; i <= M; ++i ){
        int op, a, b; scanf( "%d%d%d", &op, &a, &b ); a++; b++;
        if ( op < 2 ) Assign( a, b, op );
        if ( op == 2 ) Change( a, b );
        if ( op == 3 ) printf( "%d\n", Get1( a, b ) );
        if ( op == 4 ) printf( "%d\n", Get2( a, b ) );
    }
    return 0;
}