Rabbit的数列

https://ac.nowcoder.com/acm/contest/907/C

思路：有区间赋值可以珂朵莉树了~~注意数值为x的可能是几个区间；注意乘法的爆炸。。 

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e3+9;
const int mod=1000000007;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n,ll mo)
{
    ll ans=1;
    x%=mo;
    while(n)
    {
        if(n&1) ans=ans*x%mo;
        x=x*x%mo;
        n>>=1;
    }
    return ans;
}

ll n,x,y,a,b,c;
#define Sit set<node>::iterator
struct node
{
    int l,r;
    mutable ll val;   //保证val可变
    node(int L,int R=-1,ll v=0):l(L),r(R),val(v){}
    bool operator<(const node & a)const
    {
        return l<a.l;
    }
};
set<node>s;
Sit split(int pos)
{
    Sit it=s.lower_bound(node(pos));//找最靠近pos的l
    if(it!=s.end()&&it->l==pos)//pos就是一个区间的l
        return it;
    it--;                      //pos的所在区间进行分裂
    int L=it->l;
    int R=it->r;
    ll v=it->val;
    s.erase(it);
    s.insert(node(L,pos-1,v));
    return s.insert(node(pos,R,v)).first;//返回分裂后的右半部分,pos开头的部分
}
void Assign(int l,int r,ll v)
{
    Sit itr=split(r+1);
    Sit itl=split(l);
    s.erase(itl,itr); //整个范围删除
    s.insert(node(l,r,v));
}
map<ll,ll>mp;
int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);


    int q;
    cin>>n>>c>>q;
    //for(int i=1;i<=n;i++) s.insert(node(i,i,1));
    //Assign(1,n,1);
    s.insert(node(1,n,1));
    s.insert(node(n+1,n+1,0));
    while(q--)
    {
        cin>>x>>y>>a>>b;
        ll p=0;
        //Sit itl=split(n+1);
        //Sit itr=split(1);
        Sit itl=s.begin();
        for(;itl!=s.end();itl++)
        {
            //cout<<itl->val<<endl;
            if(itl->val==x)
            {
                p+=(ll)(itl->r-itl->l+1);
            }

        }
        p%=n;
        a%=n;
        b%=n;
        int L=(a+((p+b)*(p+b))%n)%n;
        L++;
        int R=(a+((p*b)%n*(p*b)%n)%n)%n;
        R++;
        if(L>R) swap(L,R);
        Assign(L,R,y);
        //cout<<L<<" "<<R<<endl;
        //fl();
    }

    Sit itl=s.begin();
    ll sum=0;
    ll ans=0;
    for(;itl!=s.end();itl++)
    {
        mp[itl->val]+=(ll)(itl->r-itl->l+1);
    }
    for(map<ll,ll>::iterator it=mp.begin();it!=mp.end();it++)
    {
        //cout<<it->first<<" "<<it->second<<endl;
        if(sum<it->second)
        {
            sum=it->second;
        }
    }
    cout<<sum<<endl;
    return 0;
}