排列到整数的映射算法

排列到整数的映射算法

Description：我们知道范围在(1,n)的排列共有n! 种，那么如何用小于n!的整数来表示排列呢？
Problem：给定一个排列(1,n)，如何用一个整数来表述。
Solution：For a[0],a[1],...,a[n-1]
// ans = sum(0<=i<n){p(i)*(n-1-i)!}
// p(i):the number of integers that lies on the right of s[i], and less than s[i]
// time complexity: O(n*log(n))
求解p(i)的过程，暴力的解法是O(n^2)
采用线段树或者树状数组等数据结构，能是复杂度降到O(nlogn)
以下是代码：

#include<ctime>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

const int N = 100000+10;

/* Bitree for Prefix Sum */
int _val[N];
int _sum[N];
struct Bitree{
	int n;//1-n
	Bitree(int k){
		n=1<<k;
		clear();
	}
	void clear(){
		for(int i=1;i<=n;i++)
			_val[i]=_sum[i]=0;
	}
	void add(int i,int val){
		_val[i]+=val;
		for(;i<=n;i+=-i&i)
			_sum[i]+=val;
	}
	int querySum(int i){
		int ans=0;
		for(;i>0;i-=-i&i)
			ans+=_sum[i];
		return ans;
	}
};

/* factorial */
int JC[15];
void getJC(){
	JC[0] = 1;
	for(int i=1;i<13;i++)
		JC[i] = JC[i-1]*i;
}
/* permutation */
int permutationToNumber(int* num,int n){
// assume that num is permutation of (1,n)
// seq = sum(0<=i<=n-1){p(i)*(n-1-i)!}
// p(i):the number of integers that lies on the right of s[i], and less than s[i]
// time complexity: O(n*log(n))
int pi,ans;
ans = 0;
Bitree tree(5);
for(int i=0;i<n;i++){
	tree.add(num[i],1);
}
for(int i=0;i<n;i++){
	tree.add(num[i],-1);
	pi = tree.querySum(num[i]);
	ans += pi*JC[n-1-i];
}
return ans;
}

int main(){
//freopen("data.in.txt","r",stdin);
//freopen("data.out.txt","w",stdout);
int a[5]={1,2,3,4,5};
int b[5]={5,4,3,2,1};
int c[5]={1,3,2,4,5};
int d[5]={5,1,2,3,4};
int e[5]={1,2,3,5,4};
int f[5]={4,3,1,5,2};
getJC();
cout<<permutationToNumber(a,5)<<endl;
cout<<permutationToNumber(b,5)<<endl;
cout<<permutationToNumber(c,5)<<endl;
cout<<permutationToNumber(d,5)<<endl;
cout<<permutationToNumber(e,5)<<endl;
cout<<permutationToNumber(f,5)<<endl;

//fclose(stdout);
//fclose(stdin);
system("pause");
	return 0;
}
/*

*/

reference：http://fantasyorg.blog.163.com/blog/static/109276109201112815039216/