【HDU 5145】NPY and girls

【题目】

传送门

Problem Description

NPY’s girlfriend blew him out!His honey doesn’t love him any more!However, he has so many girlfriend candidates.Because there are too many girls and for the convenience of management, NPY numbered the girls from 1 to n.These girls are in different classes(some girls may be in the same class).And the i-th girl is in class ai.NPY wants to visit his girls frequently.Each time he visits some girls numbered consecutively from L to R in some order. He can only visit one girl every time he goes into a classroom,otherwise the girls may fight with each other(-_-!).And he can visit the class in any order.

Here comes the problem,(NPY doesn’t want to learn how to use excavator),he wonders how many different ways there can be in which he can visit his girls.The different ways are different means he visits these classrooms in different order.

Input

The first line contains the number of test cases T(1≤T≤10).

For each test case,there are two integers n,m(0<n,m≤30000) in the first line.N is the number of girls,and M is the number of times that NPY want to visit his girls.

The following single line contains N integers, $a_1$,$a_2$,$a_3$,…,$a_n$, which indicates the class number of each girl. (0<$a_i$≤30000)

The following m lines,each line contains two integers l,r(1≤l≤r≤n),which indicates the interval NPY wants to visit.

Output

For each visit,print how many ways can NPY visit his girls.Because the ans may be too large,print the ans mod 1000000007.

Sample Input

2
4 2
1 2 1 3
1 3
1 4
1 1
1
1 1

Sample Output

3
12
1

【分析】

题目大意：（多组数据）给出 $n$ 个数和 $m$ 个询问，每次询问给出两个数 $l$ 和 $r$，询问 [ $l$ , $r$ ] 中的数有多少种不同的排列方式（例如 $112$ 不同的排列方式有三种，分别为 $112$、$121$、$211$）

首先有一个结论，就是对于区间 [ $l$ , $r$ ]，若用 $cnt(i)$ 表示 [ $l$ , $r$ ] 中，$i$ 这个数出现的次数，用 $x_i$ 表示 [ $l$ , $r$ ] 中出现过的所有互不相同的数，则：
$$ans=\frac{(r-l+1)!}{cnt(x_1)!\ast cnt(x_2)!\ast \cdots \ast cnt(x_k)!}$$

这个就可以理解成总共的方案数除掉相同的方案就是答案（实在不懂的话举几个例子就明白了）

那怎么维护上面的式子呢，很容易想到的是用莫队

然后注意一下预处理出阶乘和阶乘的逆元就可以了

【代码】

#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 30005
#define Mod 1000000007
using namespace std;
int a[N],ans[N],cnt[N],fac[N],inv[N];
struct node
{
	int l,r,bl,id;
}q[N];
bool comp(const node &p,const node &q)
{
	if(p.bl!=q.bl)
	  return p.bl<q.bl;
	return p.r<q.r;
}
int Power(int a,int b)
{
	int ans=1;
	while(b)
	{
		if(b&1)
		  ans=1ll*ans*a%Mod;
		a=1ll*a*a%Mod;
		b>>=1;
	}
	return ans;
}
void prework()
{
	int i;
	fac[0]=fac[1]=1;
	for(i=2;i<N;++i)  fac[i]=1ll*fac[i-1]*i%Mod;
	inv[N-1]=Power(fac[N-1],Mod-2);
	for(i=N-2;i>=0;--i)  inv[i]=1ll*(i+1)*inv[i+1]%Mod;
}
void Add(int &now,int id)
{
	now=1ll*now*fac[cnt[a[id]]]%Mod;
	now=1ll*now*inv[++cnt[a[id]]]%Mod;
}
void Del(int &now,int id)
{
	now=1ll*now*fac[cnt[a[id]]]%Mod;
	now=1ll*now*inv[--cnt[a[id]]]%Mod;
}
int main()
{
	int n,m,i,T;
	prework();
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d",&n,&m);
		int S=sqrt(n);
		for(i=1;i<=n;++i)
		  scanf("%d",&a[i]);
		for(i=1;i<=m;++i)
		{
			scanf("%d%d",&q[i].l,&q[i].r);
			q[i].id=i,q[i].bl=(q[i].l-1)/S+1;
		}
		sort(q+1,q+m+1,comp);
		int L=1,R=0,now=1;
		memset(cnt,0,sizeof(cnt));
		for(i=1;i<=m;++i)
		{
			while(R<q[i].r)  Add(now,++R);
			while(R>q[i].r)  Del(now,R--);
			while(L<q[i].l)  Del(now,L++);
			while(L>q[i].l)  Add(now,--L);
			ans[q[i].id]=1ll*fac[q[i].r-q[i].l+1]*now%Mod;
		}
		for(i=1;i<=m;++i)
		  printf("%d\n",ans[i]);
	}
	return 0;
}