#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#include "horses.h"
const int N=5e5+99,mod=1e9+7;
const ll inf=1e18+mod;
int n,t,a[N],b[N],L[N],R[N],seg[N<<1];
int pd=1;
priority_queue<int> s;
ll pow(ll x,ll y,ll mod){return(!y?1:pow(x*x%mod,y/2,mod)*(y&1?x:1))%mod;}
void build(){
f(i,0,n) seg[i+n]=b[i];
f_(i,n-1,1) seg[i]=max(seg[i<<1],seg[i<<1|1]);
}
void update(int id,int val){
seg[id]=val;
for(id>>=1;id>0;id>>=1){
seg[id]=max(seg[id<<1],seg[id<<1|1]);
}
}
int get(int l,int r){
int ans=0;
for(l+=n,r+=n;l<r;l>>=1,r>>=1){
if(l&1) maxm(ans,seg[l++]);
if(r&1) maxm(ans,seg[--r]);
}
return ans;
}
int solve(){
ll ans=1,res=pd;
vector<int> vec;
s.clear();
f(i,0,n) s.push(i);
while(1){
int i=s.top();
s.pop();
if(i==0 || a[i]>1) vec.pb(i);
maxm(ans,1ll*a[i]*max(ans,1ll*get(i,n)));
res=1ll*res*pow(a[i],mod-2,mod)%mod;
if(s.size()==0 || ans>mod) break;
}
for(auto x : vec) s.push(x);
ans%=mod;
return 1ll*res*ans%mod;
}
int init(int _n, int X[], int Y[]) {
n=_n;
f(i,0,n) a[i]=X[i];
f(i,0,n) b[i]=Y[i];
f(i,0,n){
pd=1ll*pd*a[i]%mod;
if(i==0 || a[i]>1) s.push(i);
}
build();
return solve();
}
int updateX(int pos, int val) {
if(a[pos]==1 && val!=1) s.push(pos);
pd=1ll*pd*pow(a[pos],mod-2,mod)%mod;
a[pos]=val;
pd=1ll*pd*a[pos]%mod;
return solve();
}
int updateY(int pos, int val) {
b[pos]=val;
update(pos+n,val);
return solve();
}
/*
int32_t main(){
ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n,q,a[10],b[10];
cin>>n;
f(i,0,n) cin>>a[i];
f(i,0,n) cin>>b[i];
cout<<init(n,a,b)<<endl;
cin>>q;
while(q--){
int t,pos,val;
cin>>t>>pos>>val;
if(t==1) cout<<updateX(pos,val)<<endl;
else cout<<updateY(pos,val)<<endl;
}
}*/
/*
3
2 1 3
3 4 1
1
2 1 2
*/
Compilation message
horses.cpp: In function 'long long int pow(long long int, long long int, long long int)':
horses.cpp:31:21: warning: declaration of 'mod' shadows a global declaration [-Wshadow]
31 | ll pow(ll x,ll y,ll mod){return(!y?1:pow(x*x%mod,y/2,mod)*(y&1?x:1))%mod;}
| ^
horses.cpp:24:20: note: shadowed declaration is here
24 | const int N=5e5+99,mod=1e9+7;
| ^~~
horses.cpp: In function 'int solve()':
horses.cpp:54:4: error: 'class std::priority_queue<int>' has no member named 'clear'
54 | s.clear();
| ^~~~~
horses.cpp:66:20: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
66 | return 1ll*res*ans%mod;
| ~~~~~~~~~~~^~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:73:17: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
73 | pd=1ll*pd*a[i]%mod;
| ~~~~~~~~~~~^~~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:81:33: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
81 | pd=1ll*pd*pow(a[pos],mod-2,mod)%mod;
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
horses.cpp:83:18: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
83 | pd=1ll*pd*a[pos]%mod;
| ~~~~~~~~~~~~~^~~~
