赛时一直50。

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5+10;
const int mod = 998244353;
int n,a[N];
signed main(){
	cin>>n;
	for(int i=1;i<=n;++i) cin>>a[i];
	int lst=1,ans=1;
	for(int i=2;i<=n;++i){
		int tmp=i,now=a[i],cnt=0;
		while(i<=n&&a[i]>a[lst]){
			if(a[i]!=now) ans=ans*(cnt+1)%mod,cnt=1,now=a[i];
			else ++cnt;
			++i;
		}
		ans=ans*(cnt+1)%mod;
		lst=i;
	}
	cout<<ans;
	return 0;
}