P5979 [PA2014]Druzyny dp 分治 线段树 分类讨论 启发式合并

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<ctime>
#include<cctype>
#include<queue>
#include<deque>
#include<stack>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<string>
#include<ctime>
#include<cmath>
#include<cctype>
#include<cstdlib>
#include<queue>
#include<deque>
#include<stack>
#include<vector>
#include<algorithm>
#include<utility>
#include<bitset>
#include<set>
#include<map>
#define ll long long
#define db double
#define INF 1000000000
#define inf 100000000000000000ll
#define ldb long double
#define pb push_back
#define put_(x) printf("%d ",x);
#define get(x) x=read()
#define gt(x) scanf("%d",&x)
#define gi(x) scanf("%lf",&x)
#define put(x) printf("%d\n",x)
#define putl(x) printf("%lld\n",x)
#define rep(p,n,i) for(RE int i=p;i<=n;++i)
#define go(x) for(int i=lin[x],tn=ver[i];i;tn=ver[i=nex[i]])
#define fep(n,p,i) for(RE int i=n;i>=p;--i)
#define vep(p,n,i) for(RE int i=p;i<n;++i)
#define pii pair<int,int>
#define mk make_pair
#define RE register
#define P 1000000007ll
#define gf(x) scanf("%lf",&x)
#define pf(x) ((x)*(x))
#define uint unsigned long long
#define ui unsigned
#define EPS 1e-10
#define sq sqrt
#define S second
#define F first
#define mod 1000000007
#define id(i,j) ((i+j)|(i!=j))
#define max(x,y) ((x)<(y)?y:x)
using namespace std;
char *fs,*ft,buf[1<<15];
inline char gc()
{
	return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;
}
inline int read()
{
	RE int x=0,f=1;RE char ch=gc();
	while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=gc();}
	while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=gc();}
	return x*f;
}
const int MAXN=1000010;
int n,top,rt;
int c[MAXN],d[MAXN];
int le[MAXN],s[MAXN];
int ls[MAXN],rs[MAXN];
struct wy
{
	int v,cnt;
	wy(){v=-INF;cnt=0;}
	wy(int _v,int _cnt){v=_v;cnt=_cnt;}
	inline friend wy operator +(wy a,wy b)
	{
		if(a.v==-INF)return b;
		if(b.v==-INF)return a;
		if(a.v>b.v)return a;
		if(b.v>a.v)return b;
		return wy(a.v,a.cnt+b.cnt>=mod?a.cnt+b.cnt-mod:a.cnt+b.cnt);
	}
}cc;
inline wy calc(wy b)	
{
	return b.v==-INF?b:wy(b.v+1,b.cnt);
}
wy tag[MAXN<<1],mx[MAXN<<1],f[MAXN];
inline void build()
{
	top=0;
	rep(1,n,i)
	{
		int now=0;
		while(top&&c[s[top]]<=c[i])rs[s[top]]=now,now=s[top--];
		s[++top]=i;ls[i]=now;
	}
	rt=s[1];
	while(top>1)rs[s[top-1]]=s[top],--top;
}
inline void pushdown(int l,int r)
{
	int mid=(l+r)>>1;
	int ww=id(l,r),w1=id(l,mid),w2=id(mid+1,r);
	tag[w1]=tag[w1]+tag[ww];
	mx[w1]=mx[w1]+tag[ww];
	tag[w2]=tag[w2]+tag[ww];
	mx[w2]=mx[w2]+tag[ww];
	tag[ww]=f[n+1];
}
inline wy ask(int l,int r,int L,int R)
{
	if(L>R)return f[n+1];
	if(L<=l&&R>=r)return mx[id(l,r)];
	int mid=(l+r)>>1;
	if(tag[id(l,r)].v>=0)pushdown(l,r);
	if(R<=mid)return ask(l,mid,L,R);
	if(L>mid)return ask(mid+1,r,L,R);
	return ask(l,mid,L,R)+ask(mid+1,r,L,R);
}
inline void modify(int l,int r,int L,int R)
{
	if(L>R)return;
	if(L<=l&&R>=r)
	{
		int ww=id(l,r);
		mx[ww]=mx[ww]+cc;
		tag[ww]=tag[ww]+cc;
		return;
	}
	int mid=(l+r)>>1;
	if(tag[id(l,r)].v>=0)pushdown(l,r);
	if(R<=mid)modify(l,mid,L,R);
	else 
	{
		if(L>mid)modify(mid+1,r,L,R);
		else modify(l,mid,L,R),modify(mid+1,r,L,R);
	}
	mx[id(l,r)]=mx[id(l,mid)]+mx[id(mid+1,r)];
}
inline void solve(int l,int r,int x)
{
	if(l==r)
	{
		cc=f[l];modify(0,n,l,r);
		f[l]=ask(0,n,l,r);
		return;
	}
	solve(l,x-1,ls[x]);
	int p=lower_bound(le+x,le+r+1,l)-le;
	int q=lower_bound(le+x,le+r+1,x)-le;
	if(x-l<r-x+1)
	{
		wy ww;
		vep(l,x,i)
		{
			ww=ww+f[i];
			if(i+c[x]>=x&&i+c[x]<p)
				f[i+c[x]]=f[i+c[x]]+calc(ww);
		}
		cc=calc(ww);modify(0,n,x+c[x],p-1);
	}
	else
	{
		wy ww=ask(0,n,l,x-c[x]-1);
		vep(x,p,i)
		{
			if(i-c[x]>=l&&i-c[x]<x)ww=ww+f[i-c[x]];
			f[i]=f[i]+calc(ww);
		}
	}
	vep(p,q,i)f[i]=f[i]+calc(ask(0,n,le[i],min(x-1,i-c[x])));
	solve(x,r,rs[x]);
}
int main()
{
	//freopen("1.in","r",stdin);
	get(n);
	rep(1,n,i)get(c[i]),get(d[i]);
	int h=1,t=0;
	rep(1,n,i)
	{
		le[i]=le[i-1];
		while(h<=t&&d[i]<=d[s[t]])--t;
		s[++t]=i;
		while(i-le[i]>d[s[h]])
		{
			++le[i];
			if(le[i]>=s[h])++h;
		}
		//cout<<le[i]<<endl;
	}
	build();f[0]=wy(0,1);
	solve(0,n,rt);
	if(f[n].v==-INF)puts("NIE");
	else printf("%d %d\n",f[n].v,f[n].cnt);
	return 0;
}