几天前的题了,都不太记得了。
大概是令dp[i][j][k]表示i-n,上一个字母是j,已经分成k段的方案数。然后对k求一个前缀和再一位一位搞下去就好了吧。
AC代码如下:
#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
#define N 50005
using namespace std;
const char c[5]={' ','A','C','G','T'};
int n,m,a[N]; ll now,dp[N][5][11],sum[N][5][11]; char s[N];
int main(){
scanf("%d%d%lld",&n,&m,&now);
scanf("%s",s+1);
int i,j,k,l;
for (i=1; i<=n; i++)
if (s[i]=='A') a[i]=1; else
if (s[i]=='C') a[i]=2; else
if (s[i]=='G') a[i]=3; else
if (s[i]=='T') a[i]=4;
if (a[n]) dp[n][a[n]][1]=1;
else for (i=1; i<=4; i++) dp[n][i][1]=1;
for (i=n-1; i; i--)
for (j=1; j<=4; j++)
if (!a[i] || a[i]==j)
for (k=1; k<=m; k++)
for (l=1; l<=4; l++) dp[i][j][k]+=dp[i+1][l][k-(l<j)];
for (i=1; i<=n; i++)
for (j=1; j<=4; j++)
for (k=1; k<=m; k++) sum[i][j][k]=sum[i][j][k-1]+dp[i][j][k];
for (i=1,k=0; i<=n; i++)
if (a[i]){
putchar(c[a[i]]);
if (a[i]<k) m--; k=a[i];
} else{
for (j=1; j<=4 && sum[i][j][m-(j<k)]<now; j++) now-=sum[i][j][m-(j<k)];
putchar(c[j]);
if (j<k) m--; k=j;
}
puts("");
return 0;
}
by lych
2016.9.4