【BestCoder】 HDOJ 5225 Tom and permutation

最新推荐文章于 2016-07-23 18:55:33 发布

yysys

最新推荐文章于 2016-07-23 18:55:33 发布

阅读量447

点赞数

分类专栏： BestCoder 文章标签： BestCoder

本文链接：https://blog.csdn.net/blankcqk/article/details/45624187

版权

BestCoder 专栏收录该内容

33 篇文章 0 订阅

订阅专栏

从前向后填数，每次填没用过的比a[i]小的数，然后每次统计i之前的逆序对数×后面的排列数，和后面的逆序对数。。。。

#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 105
#define maxm 80005
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
//head

LL sum[maxn];
LL h[maxn];
LL xp[maxn];
int a[maxn];
bool vis[maxn];
int n;

void work()
{
	memset(vis, 0, sizeof vis);
	memset(sum, 0, sizeof sum);
	for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
	LL ans = 0, tmp = 0, cnt = 0;
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j < a[i]; j++) {
			if(vis[j]) continue;
			tmp = cnt;
			for(int k = 1; k < i; k++) tmp += a[k] > j;
			for(int k = 1; k < j; k++) if(!vis[k]) tmp++;
			for(int k = 1; k <= n; k++) if(!vis[k] && k != j) tmp += sum[k];
			tmp %= mod;
			ans = (ans + h[n-i] + xp[n-i] * tmp % mod) % mod;
		}
		for(int j = 1; j < i; j++) cnt += a[j] > a[i];
		vis[a[i]] = true;
		for(int j = 1; j < a[i]; j++) sum[j]++;
	}
	printf("%lld\n", ans);
}

int main()
{
	xp[0] = 1, h[0] = 1;
	for(int i = 1; i <= 100; i++) xp[i] = xp[i-1] * i % mod;
	for(int i = 1; i <= 100; i++) h[i] = h[i-1] * i % mod;
	for(int i = 1; i <= 100; i++) h[i] = h[i] * i % mod * (i - 1) % mod;
	for(int i = 1; i <= 100; i++) h[i] = h[i] * powmod(4, mod-2);
	while(scanf("%d", &n)!=EOF) work();
	
	return 0;
}