#include "horses.h"
#include <iostream>
#include <string>
#include <set>
using namespace std;
long long mod = 1e9 + 7;
long long ll(int a)
{
return (long long)(a);
}
int* currv;
struct segtree
{
int l;
int r;
long long p_mod = 1;
long long p_actual = 1;
long long mx = 1;
segtree* left = NULL;
segtree* right = NULL;
segtree()
{
;
}
segtree(int L, int R)
{
l = L;
r = R;
if(l == r)
{
p_mod = p_actual = mx = currv[l];
}
else
{
int m = (l+r)/2;
left = new segtree(l, m);
right = new segtree(m+1, r);
p_mod = (left->p_mod * right->p_mod) % mod;
p_actual = left->p_actual * right->p_actual;
mx = max(left->mx, right->mx);
}
}
long long rangeprod_mod(int L, int R)
{
if(L > R) return 1;
if(r < L || R < l) return 1;
if(L <= l && r <= R) return p_mod;
return (left->rangeprod_mod(L, R) * right->rangeprod_mod(L, R)) % mod;
}
long long rangeprod_actual(int L, int R)
{
if(L > R) return 1;
if(r < L || R < l) return 1;
if(L <= l && r <= R) return p_actual;
return left->rangeprod_actual(L, R) * right->rangeprod_actual(L, R);
}
long long rangemax(int L, int R)
{
if(r < L || R < l) return 0;
if(L <= l && r <= R) return mx;
return max(left->rangemax(L, R), right->rangemax(L, R));
}
void update(int I, long long V)
{
if(I < l || r < I) return;
if(l == r)
{
p_mod = p_actual = mx = V;
}
else
{
left->update(I, V);
right->update(I, V);
p_mod = (left->p_mod * right->p_mod) % mod;
p_actual = left->p_actual * right->p_actual;
mx = max(left->mx, right->mx);
}
}
};
struct growth
{
int i;
long long x;
};
bool operator < (growth A, growth B)
{
return A.i > B.i;
}
int N;
segtree X;
segtree Y;
set<growth> Xset;
int compute()
{
// if(Xset.size() == 0) return Y.rangemax(0, N-1);
long long maxprod = 1, maxprod_pos = 0;
for(growth g: Xset)
{
maxprod *= g.x;
if(maxprod > ll(1e9))
{
maxprod_pos = g.i + 1;
break;
}
} //maxprod_pos is the last position with a suffix product <= 1e9
long long res = 0, res_pos = -1;
// for(int i = 0; i < N; i++) cout << X.rangeprod_mod(i, i) << ' ';
// cout << '\n';
// for(int i = 0; i < N; i++) cout << X.rangeprod_actual(i, i) << ' ';
// cout << '\n';
// for(int i = 0; i < N; i++) cout << Y.rangemax(i, i) << ' ';
// cout << '\n';
for(growth g: Xset)
{
if(g.i < maxprod_pos - 1) break;
if(X.rangeprod_actual(maxprod_pos, g.i) * Y.rangemax(g.i, N-1) >= res)
{
res = X.rangeprod_actual(maxprod_pos, g.i) * Y.rangemax(g.i, N-1);
res_pos = g.i;
}
// if(g.i > 0 && X.rangeprod_actual(maxprod_pos, g.i-1) * Y.rangemax(g.i-1, N-1) > res)
// {
// res = X.rangeprod_actual(maxprod_pos, g.i-1) * Y.rangemax(g.i-1, N-1);
// res_pos = g.i-1;
// }
}
return int( (X.rangeprod_mod(0, res_pos) * Y.rangemax(res_pos, N-1)) % mod );
}
int init(int n, int x[], int y[])
{
N = n;
currv = x;
X = segtree(0, N-1);
currv = y;
Y = segtree(0, N-1);
Xset.insert(growth{-1, 1});
for(int i = 0; i < N; i++)
{
if(x[i] != 1) Xset.insert(growth{i, ll(x[i])});
}
return compute();
}
int updateX(int pos, int val)
{
int curr_val = X.rangemax(pos, pos);
if(curr_val != 1) Xset.erase(growth{pos, curr_val});
X.update(pos, val);
if(val != 1) Xset.insert(growth{pos, val});
return compute();
}
int updateY(int pos, int val)
{
Y.update(pos, val);
return compute();
}
