题意:
求元素完全相同的最长下降子序列的数量
题解:
-
当 f i = f j + 1 f_i=f_j+1 fi=fj+1且 a i < a j a_i<a_j ai<aj时, c n t i = c n t i + c n t j cnt_i=cnt_i+cnt_j cnti=cnti+cntj
-
当 f i = = f j f_i==f_j fi==fj且 a i = = a j a_i==a_j ai==aj时, c n t j = 0 cnt_j=0 cntj=0避免重复计算
#include<iostream>
#include<sstream>
#include<string>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<vector>
#include<stack>
#include <utility>
#include<list>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<time.h>
#include<random>
using namespace std;
#include<ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
using namespace __gnu_pbds;
#include<ext/rope>
using namespace __gnu_cxx;
#define int long long
#define PI acos(-1.0)
#define eps 1e-9
#define lowbit(a) ((a)&-(a))
const int mod = 1e9+7;
int qpow(int a,int b){
int ans=1;
while(b){
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
const int INF = 0x3f3f3f3f;
const int N = 1e6+10;
int a[5005],f[5005],cnt[5005];
#define endl '\n'
signed main(){
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int n; cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
int maxlen=0,ans=0;
for(int i=1;i<=n;i++){
for(int j=1;j<i;j++)if(a[i]<a[j])f[i]=max(f[i],f[j]+1);
if(!f[i])f[i]++;
for(int j=1;j<i;j++){
if(a[i]<a[j]&&f[i]==f[j]+1)cnt[i]+=cnt[j];
else if(a[i]==a[j]&&f[i]==f[j])cnt[j]=0;
}
if(!cnt[i])cnt[i]=1;
maxlen=max(maxlen,f[i]);
}
for(int i=1;i<=n;i++)if(f[i]==maxlen)ans+=cnt[i];
cout<<maxlen<<" "<<ans<<endl;
}