显然按照
a
a
a建出笛卡尔树
设
f
[
u
]
[
h
]
f[u][h]
f[u][h]表示点
u
u
u对应的
[
l
,
r
]
[l,r]
[l,r]区间内所有星星最高的高度为
h
h
h的最小答案
考虑转移的时候合并左右儿子与自己的答案
设当前点高度为
h
t
ht
ht
那么就是三部分只有其中一个存在高度
≥
h
t
\geq ht
≥ht的点
其余两部分只能在
[
0
,
h
t
]
[0,ht]
[0,ht]里选最小的
f
f
f
线段树合并维护这个
D
P
DP
DP即可
复杂度
O
(
n
l
o
g
n
)
O(nlogn)
O(nlogn)
事实证明跑不过
s
e
t
/
m
a
p
/
b
i
t
+
set/map/bit+
set/map/bit+启发式合并
O
(
n
l
o
g
2
n
)
O(nlog^2n)
O(nlog2n)
代码量也被吊打
#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<20|1;
inline char gc(){
static char ibuf[RLEN],*ib,*ob;
(ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob)?EOF:*ib++;
}
inline int read(){
char ch=gc();
int res=0;bool f=1;
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
return f?res:-res;
}
inline ll readll(){
char ch=gc();
ll res=0;bool f=1;
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
return f?res:-res;
}
inline int readstring(char *s){
int top=0;char ch=gc();
while(isspace(ch))ch=gc();
while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
return top;
}
template<typename tp>inline void chemx(tp &a,tp b){a<b?a=b:0;}
template<typename tp>inline void chemn(tp &a,tp b){a>b?a=b:0;}
cs int N=200005;
char xxx;
int rt[N];
cs ll inf=1e18;
namespace Seg{
cs int N=::N*47;
int lc[N],rc[N],tot;
ll s[N],tag[N];
inline void init(){s[0]=inf;}
#define mid ((l+r)>>1)
inline void pushnow(int u,ll k){
tag[u]+=k,s[u]+=k;
}
inline void pushdown(int u){
if(!tag[u])return;
lc[u]&&(pushnow(lc[u],tag[u]),1);
rc[u]&&(pushnow(rc[u],tag[u]),1);
tag[u]=0;
}
void merge(int &u,int r1,int r2){
if(!r1||!r2){u=r1+r2;return;}
pushdown(r1),pushdown(r2);
u=r1;s[u]=min(s[r1],s[r2]);
merge(lc[u],lc[r1],lc[r2]),merge(rc[u],rc[r1],rc[r2]);
}
ll query(int u,int l,int r,int st,int des){
if(!u)return inf;
pushdown(u);
if(st<=l&&r<=des)return s[u];
ll res=inf;
(st<=mid)&&(chemn(res,query(lc[u],l,mid,st,des)),1);
(mid<des)&&(chemn(res,query(rc[u],mid+1,r,st,des)),1);
return res;
}
void upd(int &u,int l,int r,int st,int des,ll k){
if(!u)return;
if(st<=l&&r<=des)return pushnow(u,k);
pushdown(u);
(st<=mid)&&(upd(lc[u],l,mid,st,des,k),1);
(mid<des)&&(upd(rc[u],mid+1,r,st,des,k),1);
}
void update(int &u,int l,int r,int p,ll k){
if(!u)u=++tot,s[u]=inf;
pushdown(u);
if(l==r)return chemn(s[u],k);
(p<=mid)?update(lc[u],l,mid,p,k):update(rc[u],mid+1,r,p,k);
s[u]=min(s[lc[u]],s[rc[u]]);
}
#undef mid
}
int tot,ht[N],lc[N],rc[N],n,m;
ll s[N],sum[N];
vector<pii>nd[N];
char yyy;
namespace seg{
pii mx[N<<2];
#define mid ((l+r)>>1)
#define lc (u<<1)
#define rc ((u<<1)|1)
void build(int u,int l,int r){
if(l==r){mx[u]=pii(ht[l],l);return;}
build(lc,l,mid),build(rc,mid+1,r);
mx[u]=max(mx[lc],mx[rc]);
}
pii query(int u,int l,int r,int st,int des){
if(st<=l&&r<=des)return mx[u];
if(des<=mid)return query(lc,l,mid,st,des);
if(mid<st)return query(rc,mid+1,r,st,des);
return max(query(lc,l,mid,st,des),query(rc,mid+1,r,st,des));
}
#undef mid
#undef lc
#undef rc
}
inline bool in(int l,int x,int r){return l<=x&&x<=r;}
void solve(int &u,int l,int r){
if(l>r)return;
u=++tot;
if(l==r){
for(pii &x:nd[l])
Seg::update(rt[u],0,n,x.fi,s[l]-x.se);
Seg::update(rt[u],0,n,0,s[l]);
return;
}
int mx=0,mid=0;
pii now=seg::query(1,1,n,l,r);
mx=now.fi,mid=now.se;
solve(lc[u],l,mid-1),solve(rc[u],mid+1,r);
ll mx1=Seg::query(rt[lc[u]],0,n,0,mx);
ll mx3=Seg::query(rt[rc[u]],0,n,0,mx);
if(!lc[u])mx1=0;if(!rc[u])mx3=0;
Seg::upd(rt[lc[u]],0,n,0,n,s[mid]+mx3);
Seg::upd(rt[rc[u]],0,n,0,n,s[mid]+mx1);
Seg::merge(rt[u],rt[lc[u]],rt[rc[u]]);
for(pii &x:nd[mid])Seg::update(rt[u],0,n,x.fi,mx1+mx3+s[mid]-x.se);
sum[u]=s[mid]+sum[lc[u]]+sum[rc[u]];
}
int main(){
#ifdef Stargazer
freopen("lx.in","r",stdin);
cout<<(&yyy-&xxx)/1024/1024<<'\n';
#endif
n=read();
for(int i=1;i<=n;i++)ht[i]=read();
seg::build(1,1,n);
m=read();
for(int i=1;i<=m;i++){
int x=read(),y=read(),vl=read();
nd[x].pb(pii(y,vl)),s[x]+=vl;
}int root=0;
Seg::init();
solve(root,1,n);
cout<<Seg::query(rt[root],0,n,0,n)<<'\n';
return 0;
}