[DP] BZOJ 4574 [Zjoi2016]线段树

实在是不会食用 题解戳这里

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;

#define read(x) scanf("%d",&(x))
const int N=405;
const int P=1e9+7;

int n,q,a[N],rnk[N],b[N];
int C[N],A[N][N];
int f[2][N][N],sum[N][N];

inline bool cmp(int x,int y){
  return a[x]<a[y];
}
inline void add(int &x,int y){
  x+=y; if (x>=P) x-=P;
}

inline void Solve(int l,int r,int now){
  for (int i=l;i<=r;i++) for (int j=l;j<=r;j++) f[0][i][j]=f[1][i][j]=0;
  int t=0;
  f[0][l][r]=1;
  int tmp;
  for (int k=1;k<=q;k++,t^=1){
    for (int i=l;i<=r;i++){  
      tmp=0; 
      for(int j=r;j>=i;j--)
        f[t^1][i][j]=tmp,add(tmp,(ll)f[t][i][j]*(n-j)%P);
    }  
    for (int j=l;j<=r;j++){
      tmp=0;  
      for(int i=l;i<=j;i++)  
    add(f[t^1][i][j],tmp),add(tmp,(ll)f[t][i][j]*(i-1)%P);
    }  
    for (int i=l;i<=r;i++)
      for (int j=i;j<=r;j++)
        add(f[t^1][i][j],(ll)f[t][i][j]*A[i][j]%P);
  }
  for (int i=l;i<=r;i++){  
    tmp=0;  
    for (int j=r;j>=i;j--)  
      add(tmp,f[t][i][j]),add(sum[j][now],tmp);
  }  
}

int main(){
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); read(q);
  for (int i=0;i<=n;i++) C[i]=i*(i+1)/2;
  for (int i=1;i<=n;i++) for(int j=i;j<=n;j++) A[i][j]=C[i-1]+C[n-j]+C[j-i+1]; 
  for (int i=1;i<=n;i++) read(a[i]),b[i]=i;
  sort(b+1,b+n+1,cmp);
  for (int i=1;i<=n;i++) rnk[b[i]]=i;
  for (int i=1;i<=n;i++){  
    int l=i,r=i;  
    while (l>1 && a[l-1]<a[i]) l--;  
    while (r<n && a[r+1]<a[i]) r++;  
    Solve(l,r,rnk[i]);  
  }
  int ans,tmp;
  for (int i=1;i<=n;i++){  
    ans=tmp=0;  
    for (int j=1;j<=n;j++){
      if (!sum[i][j]) continue;
      add(sum[i][j],P-tmp);
      add(ans,(ll)sum[i][j]*a[b[j]]%P);
      add(tmp,sum[i][j]);
    }  
    printf("%d%c",ans,i==n?'\n':' ');  
  }
  return 0;  
}