1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
|
using namespace std; typedef long long ll; const int maxn=1e6+50; const ll mod=1e9+7; int a[maxn],l[maxn],r[maxn],sz[maxn]; ll inv[maxn]; ll ans; stack<int>s; void (int u){ sz[u]=1; if(l[u]) dfs(l[u]),sz[u]+=sz[l[u]]; if(r[u]) dfs(r[u]),sz[u]+=sz[r[u]]; ans=ans*inv[sz[u]]%mod; } int main(){ inv[0]=inv[1]=1; for(int i=2;i<=1e6;i++) inv[i]=1LL*inv[mod%i]*(mod-mod/i)%mod; int t; cin>>t; while(t--){ int n,rt; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; l[i]=r[i]=0; while(!s.empty()&&a[i]>a[s.top()]) l[i]=s.top(),s.pop(); if(!s.empty()) r[s.top()]=i; s.push(i); } while(!s.empty()) rt=s.top(),s.pop(); ans=1LL*inv[2]*n; dfs(rt); cout<<ans<<endl; } return 0; }
|
近期评论