区间Dp,经典问题最长上升公共子序列的变式;
计数需要去重,思想在于对于本质相同的序列均将其表示到最大的哪个;
然后dp时依据包含关系就可以去重啦;
#include<cstdio>
#include<algorithm>
#include<cstring>
#define rep(i,k,n) for(int i=k;i<=n;i++)
#define rep2(i,k,n) for(int i=k;i>=n;i--)
#define cnt second
#define len first
#define mk make_pair
#define pa pair<int,int>
using namespace std;
const int N=5e3+7;
const int mod=1e9+7;
void upd(int& x,int y){x+=y;if(x>=mod)x-=mod;}
int n,m,a[N],p[N],pre[N][N],nxt[N][N];
pa d[N][N],now;
void init(){
rep(i,1,n)scanf("%d",&a[i]),p[i]=a[i];
sort(p+1,p+n+1);m=unique(p+1,p+n+1)-p;
rep(i,1,n)a[i]=lower_bound(p+1,p+m,a[i])-p;
memset(p,0,sizeof(p));rep(i,0,n+1){rep(j,1,m)pre[i][j]=p[j];p[a[i]]=i;}
memset(p,0,sizeof(p));rep2(i,n+1,0){rep(j,1,m)nxt[i][j]=p[j];p[a[i]]=i;}
}
int main(){
while(scanf("%d",&n)==1){
init();
rep2(i,n,1){
d[i][i]=mk(1,1);
now=mk(0,1);
rep(j,i+1,n){
d[i][j]=mk(0,0);
if(a[i]==a[j])d[i][j]=mk(now.len+2,now.cnt);
if(a[i]>=a[j]){
int l=nxt[i][a[j]],r=pre[j][a[j]];
if(d[l][j].len>now.len)now=d[l][j];
else if(d[l][j].len==now.len){
if(l<=r && d[l][r].len==d[l][j].len){
upd(now.cnt,(mod-d[l][r].cnt)%mod);
}
upd(now.cnt,d[l][j].cnt);
}
}
}
}now=mk(0,0);
rep(i,1,m){
int l=nxt[0][i],r=pre[n+1][i];
if(!l || !r)break;
if(d[l][r].len>now.len)now=d[l][r];
else if(d[l][r].len==now.len){
upd(now.cnt,d[l][r].cnt);
}
}printf("%d %d\n",now.len,now.cnt);
}
}