2431: [HAOI2009]逆序对数列
Time Limit: 5 Sec Memory Limit: 128 MBSubmit: 2150 Solved: 1238
[Submit][Status][Discuss]
Description
对于一个数列{ai},如果有i<j且ai>aj,那么我们称ai与aj为一对逆序对数。若对于任意一个由1~n自然数组成的
数列,可以很容易求出有多少个逆序对数。那么逆序对数为k的这样自然数数列到底有多少个?
Input
第一行为两个整数n,k。
Output
写入一个整数,表示符合条件的数列个数,由于这个数可能很大,你只需输出该数对10000求余数后的结果。
Sample Input
4 1
Sample Output
3
样例说明:
下列3个数列逆序对数都为1;分别是1 2 4 3 ;1 3 2 4 ;2 1 3 4;
100%的数据 n<=1000,k<=1000
样例说明:
下列3个数列逆序对数都为1;分别是1 2 4 3 ;1 3 2 4 ;2 1 3 4;
100%的数据 n<=1000,k<=1000
三维的dp很好想(看下面代码)
觉得过不了(不小心交错发现也能过 笑哭) 维护了一下前缀和
ac代码
#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return x*f;
}
void print(int x)
{if(x<0)putchar('-'),x=-x;if(x>=10)print(x/10);putchar(x%10+'0');}
const int N=1010,mod=10000;
int f[N][N],sum[N],tmp[N];
int main()
{
register int i,j,k,n=read(),m=read();
f[1][0]=1;tmp[0]=sum[0]=1;int lim=1;
for(i=2;i<=n;++i)
{
for(j=0;j<=min(m,i*(i-1)/2);++j)
{
if(j>lim)sum[j]=sum[j-1];
f[i][j]=f[i-1][j];
if(j!=0)i-1<j?f[i][j]+=sum[j-1]-sum[j-i]+mod:f[i][j]+=sum[j-1];
f[i][j]%=mod;
if(j!=0){tmp[j]=(tmp[j-1]+f[i][j]+mod)%mod;}
}
for(j=0;j<=min(m,i*(i-1)/2);++j)sum[j]=tmp[j];lim=min(m,i*(i-1)/2);
}
print(f[n][m]);puts("");
return 0;
}
当然好东西都在后面
心血来潮 写了个对拍。。。
datamaker#include<iostream>
#include<ctime>
#include<cstdio>
using namespace std;
int main()
{
freopen("lala.in","w",stdout);
srand(time(NULL));
int n=rand()%10+1;if(n==1)n=10;
int k=rand()%(n*(n-1)/2)+1;
cout<<n<<" "<<k<<endl;
fclose(stdout);
return 0;
}
暴力
#include<iostream>
#include<cmath>
#include<cstdlib>
using namespace std;
int n,k,ans;
int a[100];
bool book[100];
void dfs(int step,int aim)
{
if(step>n)
{
int tmp=0;
for(int i=1;i<=n;++i)for(int j=i+1;j<=n;++j)if(a[j]<a[i])tmp++;
if(tmp==aim)ans++;ans%=10000;
return ;
}
for(int i=1;i<=n;++i)
{
if(book[i])continue;
book[i]=1;a[step]=i;
dfs(step+1,aim);
book[i]=0;
}
}
int main()
{
freopen("lala.in","r",stdin);
freopen("pai.out","w",stdout);
cin>>n>>k;dfs(1,k);
cout<<ans<<endl;
fclose(stdin);fclose(stdout);
return 0;
}
三维dp
#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return x*f;
}
void print(int x)
{if(x<0)putchar('-'),x=-x;if(x>=10)print(x/10);putchar(x%10+'0');}
const int N=1010,mod=10000;
int f[N][N];
int main()
{
freopen("lala.in","r",stdin);freopen("dui.out","w",stdout);
register int i,j,k,n=read(),m=read();
f[1][0]=1;
for(i=2;i<=n;++i)
{
for(j=0;j<=min(m,i*(i-1)/2);++j)
{
f[i][j]=f[i-1][j];
for(k=1;k<=min(i-1,j);++k)
{
(f[i][j]+=f[i-1][j-k])%=mod;
}
}
}
print(f[n][m]);puts("");
fclose(stdin);fclose(stdout);
return 0;
}
对拍程序
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<ctime>
using namespace std;
int main()
{
int n=100;
while(n--)
{
system("datamaker.exe");
system("dui.exe");
system("pai.exe");
if(system("fc dui.out pai.out"))
{
cout<<"WA"<<endl;
return 0;
}
}
cout<<"A"<<endl;return 0;
}