結果
| 問題 | No.3812 Max Min Sigma Problem |
| コンテスト | |
| ユーザー |
ryoku
|
| 提出日時 | 2026-11-20 22:08:55 |
| 言語 | C++23(gnu拡張gcc16) (gcc 16.2.0 + boost 1.92.0 + ACL) |
| 結果 |
WA
不安定
|
| 実行時間 | - |
| コード長 | 25,106 bytes |
| 記録 | |
| コンパイル時間 | 7,070 ms |
| コンパイル使用メモリ | 400,636 KB |
| 実行使用メモリ | 65,040 KB |
| 最終ジャッジ日時 | 2026-11-20 22:09:17 |
| 合計ジャッジ時間 | 21,015 ms |
|
ジャッジサーバーID (参考情報) |
judge1_0 / judge2_0 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 14 WA * 14 |
ソースコード
// library begin: "lib/template.hpp"
//https://github.com/ryoku1020/lib
#ifdef TEMPLATE
#else
#define TEMPLATE
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#include<cassert>
using namespace std;
namespace ryoku{}
using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using i128=__int128;
using u128=unsigned __int128;
template<class T>using vc=vector<T>;
template<class T>using vvc=vc<vc<T>>;
template<class T>using vvvc=vvc<vc<T>>;
template<class T>using smpq=priority_queue<T,vector<T>,greater<T>>;
template<class T>using bipq=priority_queue<T>;
using vi=vc<int>;
using vvi=vvc<int>;
using vl=vc<ll>;
using vvl=vvc<ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(j);i<(ll)(n);i++)
#define DREP(i,n,m) for(ll i=ll(n);i>=ll(m);i--)
#define drep(i,n) for(ll i=(ll(n)-1);i>=0;i--)
#define rall(x) x.rbegin(),x.rend()
#define mp(...) make_pair(__VA_ARGS__)
#define pb push_back
#define fi first
#define se second
#define is insert
#define bg begin()
#define ed end()
#define all(x) x.begin(),x.end()
istream& operator>>(istream&is,i128&x){
string s;if(!(is>>s))return is;
u128 y=0;
int i=0,neg=0;
if(s[0]=='-'||s[0]=='+')neg=s[0]=='-',i=1;
for(;i<(int)s.size();i++)y=y*10+s[i]-'0';
x=neg?(y?-(i128)(y-1)-1:0):(i128)y;
return is;
}
ostream& operator<<(ostream&os,i128 x){
if(x==0)return os<<0;
if(x<0)os<<"-";
u128 y=x<0?-(u128)x:(u128)x;
string s;
while(y)s.pb('0'+y%10),y/=10;
reverse(all(s));
return os<<s;
}
void scan(int&a){cin>>a;}
void scan(ll&a){cin>>a;}
void scan(i128&a){cin>>a;}
void scan(string&a){cin>>a;}
void scan(char&a){cin>>a;}
void scan(uint&a){cin>>a;}
void scan(ull&a){cin>>a;}
void scan(bool&a){cin>>a;}
void scan(ld&a){ cin>>a;}
template<class A,class B>
void scan(pair<A,B>&p){
scan(p.first);
scan(p.second);
}
template<class C>void scan(C&a){for(auto&x:a)scan(x);}
void read(){}
template<class Head,class... Tail>void read(Head&head,Tail&... tail){scan(head); read(tail...);}
#define INT(...) int __VA_ARGS__; read(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; read(__VA_ARGS__);
#define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__);
#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);
#define VC(type,name,...) vector<type> name(__VA_ARGS__); read(name);
#define VVC(type,name,size,...) vector<vector<type>> name(size,vector<type>(__VA_ARGS__)); read(name);
template<class T>void print(T a){cout<<a;}
template<class T>void print(vector<T>a){for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}}
void PRT(){cout<<endl; return;}
template<class T>void PRT(T a){print(a); cout<<endl; return;}
template<class Head,class... Tail>void PRT(Head head,Tail... tail){print(head); cout<<" "; PRT(tail...); return;}
template<class T,class F>int chmin(T&x,F y){return x>y?(x=y,1):0;}
template<class T,class F>int chmax(T&x,F y){return x<y?(x=y,1):0;}
template<typename T>T floor(T a,T b){return a/b-(a%b&&((a<0)!=(b<0)));}
template<typename T>T ceil(T a,T b){return a/b+(a%b&&((a<0)==(b<0)));}
template<typename T>T bmod(T x,T y){return x-y*floor(x,y);}
template<typename T>
pair<T,T>divmod(T x,T y){
T q=floor(x,y);
return{q,x-q*y};
}
void YesNo(bool b){cout<<(b?"Yes":"No")<<endl;}void YESNO(bool b){cout<<(b?"YES":"NO")<<endl;}
void AliceBob(bool b){cout<<(b?"Alice":"Bob")<<endl;}
void Yes(){cout<<"Yes"<<endl;}void YES(){cout<<"YES"<<endl;}
void No(){cout<<"No"<<endl;}void NO(){cout<<"NO"<<endl;}
#ifdef LOCAL
#define LOJ(a, b) (a)
#else
#define LOJ(a, b) (b)
#endif
vc<int>stovi(const string&s,const string&S){
vc<int>v(s.size());
rep(i,s.size()){
auto t=S.find(s[i]);
assert(t!=string::npos);
v[i]=t;
}
return v;
}
template<class T=ll>
T isqrt(T x){
T F=sqrtl(x);
if(F*F>x)F--;
return F;
}
template<class C>C sorted(C a){
sort(all(a));
return a;
}
template<class C>C reved(C a){
reverse(all(a));
return a;
}
template<class T>
pair<vc<int>,vc<T>>compress(const vc<T>&a){
vc<T>xs=a;
sort(all(xs));
xs.erase(unique(all(xs)),xs.end());
vc<int>b(a.size());
rep(i,a.size())b[i]=lower_bound(all(xs),a[i])-xs.begin();
return{b,xs};
}
template<class T>
auto make_vec(int n,T x){
return vc<T>(n,x);
}
template<class... Args>
auto make_vec(int n,Args...args){
return vc(n,make_vec(args...));
}
template<class T>T tri(T x){return x*(x-1)/2;}
//[l,r)
template<class T>T tri(T l,T r){return (r-l)*(l+r-1)/2;}
//n を先頭に持ってくる
template<class C>
C rot(C v,int n){
rotate(v.begin(),v.begin()+n,v.end());
return v;
}
template<class C>
C concat(C a,const C&b){
a.insert(a.end(),b.begin(),b.end());
return a;
}
template<class Container>
auto rle(const Container&cv){
using T=typename Container::value_type;
vc<pair<T,int>>res;
for(const auto&x:cv){
if(res.empty()||res.back().fi!=x)res.pb({x,1});
else res.back().se++;
}
return res;
}
template<class T>
vc<T>iota(int n){
vc<T>v(n);rep(i,n)v[i]=i;
return v;
}
template<class T,int minfirst,class C>
vc<int>argsort(const C&a){
auto idx=iota<int>(a.size());
sort(all(idx),[&](int i,int j){
return (minfirst?make_pair(a[i],i)<make_pair(a[j],j):make_pair(a[i],i)>make_pair(a[j],j));
});
return idx;
}
template<class C>
auto trans(const C&a){
using T=typename C::value_type::value_type;
assert(a.size()&&a[0].size());
rep(i,a.size())assert(a[i].size()==a[0].size());
vvc<T>b(a[0].size(),vc<T>(a.size()));
rep(i,a.size())rep(j,a[0].size())b[j][i]=a[i][j];
return b;
}
vc<string>trans(const vc<string>&a){
assert(a.size()&&a[0].size());
rep(i,a.size())assert(a[i].size()==a[0].size());
vc<string>b(a[0].size(),string(a.size(),0));
rep(i,a.size())rep(j,a[0].size())b[j][i]=a[i][j];
return b;
}
template<class C>ll sz(const C&a){return (int)a.size();}
template<class C,class T>auto lb(const C&a,const T&x){return lower_bound(all(a),x);}
template<class C,class T>auto ub(const C&a,const T&x){return upper_bound(all(a),x);}
template<class T>int popcount(T n){return __builtin_popcountll(n);}
template<class T=void,class L=ll,class C>L sum(const C&a){return accumulate(all(a),L(0));}
template<class T>
struct subset_view{
T s;
struct iterator{
T s,x;
bool done;
T operator*()const{return x;}
iterator&operator++(){
if(x==0)done=true;
else x=(x-1)&s;
return*this;
}
bool operator!=(const iterator&r)const{return done!=r.done;}
};
iterator begin()const{return{s,s,false};}
iterator end()const{return{s,0,true};}
};
template<class T>
subset_view<T>subset(T s){return{s};}
template<class C>auto max(const C&a){return *max_element(all(a));}
template<class C>auto min(const C&a){return *min_element(all(a));}
template<class C>ll argmin(const C&a){return min_element(all(a))-a.begin();}
template<class C>ll argmax(const C&a){return max_element(all(a))-a.begin();}
template<class L=ll,class C>
vc<L>presum(const C&a){
vc<L>ret(a.size()+1);
rep(i,a.size())ret[i+1]=ret[i]+a[i];
return ret;
}
template<class T,class F>
vc<T>&operator+=(vc<T>&a,F b){
for(auto&v:a)v+=b;
return a;
}
template<class T,class F>
vc<T>&operator-=(vc<T>&a,F b){
for(auto&v:a)v-=b;
return a;
}
template<class T,class F>
vc<T>&operator*=(vc<T>&a,F b){
for(auto&v:a)v*=b;
return a;
}
template<class T,size_t N,class F>
array<T,N>&operator+=(array<T,N>&a,F b){
for(auto&v:a)v+=b;
return a;
}
template<class T,size_t N,class F>
array<T,N>&operator-=(array<T,N>&a,F b){
for(auto&v:a)v-=b;
return a;
}
template<class T,size_t N,class F>
array<T,N>&operator*=(array<T,N>&a,F b){
for(auto&v:a)v*=b;
return a;
}
template<class T=ll>
constexpr T pow(T a,T b){
T res=1;
while(b){
if(b&1)res*=a;
a*=a;
b/=2;
}
return res;
}
template<class T>
struct temporary{
T& x;T old;
template<class U>temporary(T&x,U&&y):x(x),old(x){
x=std::forward<U>(y);
}
~temporary(){x=std::move(old);}
temporary(const temporary&)=delete;
};
template<class T,class U>
temporary(T&,U&&)->temporary<T>;
#define CAT_(a,b) a##b
#define CAT(a,b) CAT_(a,b)
#define WITH(x,y) temporary CAT(_tmp_,__COUNTER__)(x,y)
constexpr ll two(ll a){return (1ll<<a);}
constexpr ll ten(ll a){return pow<ll>(10,a);}
template<typename T>constexpr T inf=numeric_limits<T>::max()/2-1;
template<>constexpr pll inf<pll> ={inf<ll>,inf<ll>};
template<class T>constexpr T neg_inf=-inf<T>;
template<>constexpr pll neg_inf<pll> ={-inf<ll>,-inf<ll>};
template<class C>C UNIQUE(C&a){
sort(all(a));
a.erase(unique(all(a)),a.end());
return a;
}
template<class T>
int tbit(T x){
using U=make_unsigned_t<T>;
U y=(U)x;
if(!y)return -1;
if(sizeof(U)>sizeof(ull)&&(u128)y>>64)return 127-__builtin_clzll((ull)((u128)y>>64));
return 63-__builtin_clzll((ull)y);
}
template<class T>
int lbit(T x){
using U=make_unsigned_t<T>;
U y=(U)x;
if(!y)return -1;
if((ull)y)return __builtin_ctzll((ull)y);
return 64+__builtin_ctzll((ull)((u128)y>>64));
}
template<class T>
int tbit(T x,int p){
using U=make_unsigned_t<T>;
constexpr int W=numeric_limits<U>::digits;
U y=(U)x;
if(p<0)return -1;
if(p>=W-1)return tbit(y);
return tbit(y&((U(1)<<(p+1))-1));
}
template<class T>
int lbit(T x,int p){
using U=make_unsigned_t<T>;
constexpr int W=numeric_limits<U>::digits;
U y=(U)x;
if(p<0)return lbit(y);
if(p>=W)return -1;
return lbit(y&(~U(0)<<p));
}
enum debug_color{
BLACK=30,RED,GREEN,YELLOW,BLUE,MAGENTA,CYAN,WHITE,
BRIGHT_BLACK=90,BRIGHT_RED,BRIGHT_GREEN,BRIGHT_YELLOW,BRIGHT_BLUE,BRIGHT_MAGENTA,BRIGHT_CYAN,BRIGHT_WHITE
};
static int dbging=1;
#ifdef LOCAL
#include"lib/debug/local.hpp"
#define mark(col) do{if(dbging!=0)::debug::internal::mark(col);}while(0)
#else
template<debug_color col,class... Ts>
void dbg(const Ts&...xs){}
#define dbg(...) ((void)0)
#define mark(...) ((void)0)
#endif
struct template_setup{
template_setup(){
#if defined(LOCAL)&&!defined(INTERACTIVE)&&!defined(SAMPLE_TEST)
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
cin.tie(0)->sync_with_stdio(0);
#ifdef LOCAL
cout<<fixed<<setprecision(6);
#else
cout<<fixed<<setprecision(20);
#endif
}
};
static struct template_setup template_setup;
#endif
// library end: "lib/template.hpp"
// library begin: "lib/ds/monoid/pair-sum.hpp"
// library include: "lib/template.hpp"
namespace ryoku{
template<class T>
struct PairSum{
using value_type=pair<T,T>;
static constexpr bool commute=true;
static value_type op(value_type a,value_type b){return {a.fi+b.fi,a.se+b.se};}
static value_type id(){return {T(0),T(0)};}
static value_type e(){return id();}
};
}
// library end: "lib/ds/monoid/pair-sum.hpp"
// library begin: "lib/ds/monoid/sum-prod.hpp"
// library include: "lib/template.hpp"
namespace ryoku{
template<class T>
struct Sum{
using value_type=T;
static constexpr bool commute=true;
static value_type op(value_type a,value_type b){return a+b;}
static value_type id(){return T(0);}
static value_type e(){return id();}
};
template<class T>
struct Prod{
using value_type=T;
static constexpr bool commute=false;
static value_type op(value_type a,value_type b){return a*b;}
static value_type id(){return T(1);}
static value_type e(){return id();}
};
}
// library end: "lib/ds/monoid/sum-prod.hpp"
// library begin: "lib/math/modular/binom.hpp"
// library include: "lib/template.hpp"
namespace ryoku{
template<class,class=void>
struct binom_has_get_mod:false_type{};
template<class mint>
struct binom_has_get_mod<mint,void_t<decltype(mint::get_mod())>>:true_type{};
template<class mint>
struct binom{
private:
static vector<mint>&fact_table(){static vector<mint>v={1};return v;}
static vector<mint>&invfact_table(){static vector<mint>v={1};return v;}
static vector<mint>&invs_table(){static vector<mint>v={0};return v;}
static int&built_mod(){static int mod=-1;return mod;}
public:
static void build(int n){
auto&_fact=fact_table();
auto&_invfact=invfact_table();
auto&_invs=invs_table();
if constexpr(binom_has_get_mod<mint>::value){
auto mod=mint::get_mod();
if(built_mod()!=mod){
_fact={1};
_invfact={1};
_invs={0};
built_mod()=mod;
}
}
if(n<(int)_fact.size())return;
int old=_fact.size();
_fact.resize(n+1);
_invfact.resize(n+1);
_invs.resize(n+1);
if constexpr(binom_has_get_mod<mint>::value){
auto mod=mint::get_mod();
for(int i=old;i<=n;i++){
_fact[i]=_fact[i-1]*i;
if(i==1)_invs[i]=1;
else _invs[i]=-_invs[mod%i]*(mod/i);
_invfact[i]=_invfact[i-1]*_invs[i];
}
}else{
for(int i=old;i<=n;i++){
_fact[i]=_fact[i-1]*i;
_invs[i]=mint(1)/i;
_invfact[i]=_invfact[i-1]*_invs[i];
}
}
}
static mint fact(int i){
assert(i>=0);
build(i);
return fact_table()[i];
}
static mint invfact(int i){
assert(i>=0);
build(i);
return invfact_table()[i];
}
static mint inv(int i){
assert(i>0);
build(i);
return invs_table()[i];
}
static mint C(int a,int b){//aCb
if(b==0)return 1;
if(a<0||b<0||a-b<0)return mint(0);
build(a);
auto&_fact=fact_table();
auto&_invfact=invfact_table();
return _fact[a]*_invfact[b]*_invfact[a-b];
}
static mint iC(int a,int b){//1/aCb
if(b==0)return 1;
if(a<0||b<0||a-b<0)return mint(0);
build(a);
auto&_fact=fact_table();
auto&_invfact=invfact_table();
return _fact[b]*_fact[a-b]*_invfact[a];
}
static mint P(int a,int b){
if(a<b||b<0)return 0;
build(a);
auto&_fact=fact_table();
auto&_invfact=invfact_table();
return _fact[a]*_invfact[a-b];
}
static mint H(int a,int b){
return C(a+b-1,b);
}
};
}
// library end: "lib/math/modular/binom.hpp"
// library begin: "lib/ds/segment_tree/lazy-segtree.hpp"
// library include: "lib/template.hpp"
namespace ryoku{
template<class acted,bool beats=false>
struct lazy_segtree{
using info=typename acted::info;
using tag=typename acted::tag;
using value_type=typename acted::value_type;
using lazy_type=typename acted::lazy_type;
template<class T,class=void>
struct has_commute{
static constexpr bool value=false;
};
template<class T>
struct has_commute<T,decltype((void)T::commute,void())>{
static constexpr bool value=T::commute;
};
static constexpr bool commute=has_commute<tag>::value;
int N;
int n;
int lg;
vc<value_type>node;
vc<lazy_type>lazy;
vc<int>len;
void build(int N_){
assert(N_>=0);
N=N_;
lg=0;
while((1<<lg)<N)lg++;
n=1<<lg;
node=vc<value_type>(n*2,info::id());
lazy=vc<lazy_type>(n,tag::id());
len=vc<int>(n*2);
REP(i,n,n*2)len[i]=(i-n<N);
DREP(i,n-1,1)len[i]=len[i*2]+len[i*2+1];
}
lazy_segtree(int N,value_type leaf=info::id()){
build(N);
REP(i,n,n*2)node[i]=(i-n<N?leaf:info::id());
DREP(i,n-1,1)update(i);
}
lazy_segtree(int N,vc<value_type> A){
build(N);
A.resize(n,info::id());
REP(i,n,n*2)node[i]=A[i-n];
DREP(i,n-1,1)update(i);
}
template<class F>requires is_invocable_r_v<value_type,F&,int>
lazy_segtree(int N,F f){
build(N);
REP(i,n,n*2){
if(i-n<N)node[i]=f(i-n);
else node[i]=info::id();
}
DREP(i,n-1,1)update(i);
}
void all_apply(int k,lazy_type x){
assert(0<=k&&k<n*2);
node[k]=acted::act(node[k],x,len[k]);
if(k<n){
lazy[k]=tag::op(lazy[k],x);
if constexpr(beats){
if(node[k].fail())push(k),update(k);
}
}
}
void push(int k){
assert(0<k&&k<n);
all_apply(k*2,lazy[k]);
all_apply(k*2+1,lazy[k]);
lazy[k]=tag::id();
}
void update(int i){
assert(0<i&&i<n);
node[i]=acted::act(info::op(node[i*2],node[i*2+1]),lazy[i],len[i]);
}
void set(int i,value_type x){
assert(0<=i&&i<N);
i+=n;
for(int j=lg;j;j--)push(i>>j);
node[i]=x;
for(int j=1;j<=lg;j++)update(i>>j);
}
value_type prod(int l,int r){
assert(0<=l&&l<=r&&r<=N);
if(l==r)return info::id();
if constexpr(commute){
auto dfs=[&](auto&dfs,int k,int sl,int sr,lazy_type x)->value_type{
if(sr<=l||r<=sl)return info::id();
if(l<=sl&&sr<=r)return acted::act(node[k],x,len[k]);
x=tag::op(lazy[k],x);
int mid=(sl+sr)>>1;
return info::op(dfs(dfs,k*2,sl,mid,x),dfs(dfs,k*2+1,mid,sr,x));
};
return dfs(dfs,1,0,n,tag::id());
}
l+=n,r+=n;
for(int i=lg;i;i--){
if(((l>>i)<<i)!=l)push(l>>i);
if(((r>>i)<<i)!=r)push((r-1)>>i);
}
value_type sml=info::id(),smr=info::id();
while(l<r){
if(l&1)sml=info::op(sml,node[l++]);
if(r&1)smr=info::op(node[--r],smr);
l/=2,r/=2;
}
return info::op(sml,smr);
}
void apply(int l,int r,lazy_type x){
assert(0<=l&&l<=r&&r<=N);
if(l==r)return;
l+=n,r+=n;
if constexpr(!commute){
for(int i=lg;i;i--){
if(((l>>i)<<i)!=l)push(l>>i);
if(((r>>i)<<i)!=r)push((r-1)>>i);
}
}
int l2=l,r2=r;
while(l2<r2){
if(l2&1)all_apply(l2++,x);
if(r2&1)all_apply(--r2,x);
l2/=2,r2/=2;
}
for(int i=1;i<=lg;i++){
if(((l>>i)<<i)!=l)update(l>>i);
if(((r>>i)<<i)!=r)update((r-1)>>i);
}
}
void applyat(int i,lazy_type x){
assert(0<=i&&i<N);
i+=n;
if constexpr(!commute)for(int j=lg;j;j--)push(i>>j);
all_apply(i,x);
for(int j=1;j<=lg;j++)update(i>>j);
}
value_type all_prod(){
return node[1];
}
template<class F>
int max_right(int L,F f){
assert(0<=L&&L<=N);
if(L<N)for(int i=lg;i;i--)push((n+L)>>i);
int l=n+L,w=1;
value_type ansL=info::id();
for(;L+w<=N;l>>=1,w<<=1)if(l&1){
if(!f(info::op(ansL,node[l])))break;
ansL=info::op(ansL,node[l++]);
L+=w;
}
while(w>1){
if(0<l&&l<n)push(l);
l<<=1,w>>=1;
if(L+w<=N&&f(info::op(ansL,node[l]))){
ansL=info::op(ansL,node[l++]);
L+=w;
}
}
return L;
}
template<class F>
int min_left(int R,F f){
assert(0<=R&&R<=N);
if(R>0)for(int i=lg;i;i--)push((n+R-1)>>i);
int r=n+R,w=1;
value_type ansR=info::id();
for(;R-w>=0;r>>=1,w<<=1)if(r&1){
if(!f(info::op(node[r-1],ansR)))break;
ansR=info::op(node[--r],ansR);
R-=w;
}
while(w>1){
if(0<r-1&&r-1<n)push(r-1);
r<<=1,w>>=1;
if(R-w>=0&&f(info::op(node[r-1],ansR))){
ansR=info::op(node[r-1],ansR);
R-=w;
r--;
}
}
return R;
}
};
}
#ifdef LOCAL
#include"lib/debug/formatters/ds--segment_tree--lazy-segtree.hpp"
#endif
// library end: "lib/ds/segment_tree/lazy-segtree.hpp"
// library begin: "lib/math/modular/static-mod-int.hpp"
// library include: "lib/template.hpp"
namespace ryoku{
template<uint32_t mod>
struct static_modint{
static_assert(0<mod&&mod<=(1u<<31)-1);
using u32=uint32_t;
using u64=uint64_t;
u32 val;
static_modint():val(0){}
static_modint(ll x){
ll v=x%mod;
if(v<0)v+=mod;
val=v;
}
constexpr static uint32_t get_mod(){
return mod;
}
static static_modint raw(int v){
assert(v>=0);
static_modint mi;
mi.val=v;
return mi;
}
static_modint &operator+=(const static_modint&m){
u32 x=val+m.val-mod;
val=x+(mod&-(x>>31));
return *this;
}
static_modint &operator-=(const static_modint&m){
u32 x=val-m.val;
val=x+(mod&-(x>>31));
return *this;
}
static_modint &operator*=(const static_modint&m){
val=u64(val)*m.val%mod;
return *this;
}
static_modint &operator/=(const static_modint&m){
val=u64(val)*m.inv().val%mod;
return *this;
}
static_modint operator-() const{
return static_modint(mod-val);
}
static_modint operator+() const {
return *this;
}
friend static_modint operator+(static_modint lhs, const static_modint& rhs){
return lhs+=rhs;
}
friend static_modint operator-(static_modint lhs, const static_modint& rhs){
return lhs-=rhs;
}
friend static_modint operator*(static_modint lhs, const static_modint& rhs){
return lhs*=rhs;
}
friend static_modint operator/(static_modint lhs,const static_modint&rhs){
return lhs/=rhs;
}
bool operator==(const static_modint&p) const{
return p.val==val;
}
bool operator!=(const static_modint&p) const{
return p.val!=val;
}
static_modint pow(int64_t n) const{
static_modint res(1),mul(val);
while(n){
if(n%2)res*=mul;
mul*=mul;
n/=2;
}
return res;
}
friend ostream&operator<<(ostream&os,const static_modint&p){
os<<p.val;
return os;
}
friend istream&operator>>(istream&is,static_modint&p){
int64_t x;
is>>x;
p=static_modint(x);
return is;
}
static_modint inv()const{
int64_t a=val,b=mod,u=1,v=0,t;
#ifdef LOCAL
assert(gcd(a,b)==1);
#endif
while(b>0){
t=a/b;
swap(a-=t*b,b);
swap(u-=t*v,v);
}
return static_modint(u);
}
};
}
// library end: "lib/math/modular/static-mod-int.hpp"
using namespace ryoku;
// library include: "lib/math/modular/static-mod-int.hpp"
using mint=static_modint<998244353>;
using B=binom<mint>;
struct sum2{
using value_type=pair<mint,mint>;
static value_type op(value_type a,value_type b){
return{a.fi+b.fi,a.se+b.se};
}
static value_type id(){
return{};
}
};
using tag=Sum<mint>;
struct acted{
using info=::sum2;
using tag=::tag;
using value_type=typename info::value_type;
using lazy_type=typename tag::value_type;
static value_type act(value_type a,lazy_type b,ll len){
return{a.fi+b*len,a.se+b*b*len+a.fi*b*2};
}
};
struct sumxy{
using value_type=array<mint,3>;
static value_type op(value_type a,value_type b){
return{a[0]+b[0],a[1]+b[1],a[2]+b[2]};
}
static value_type id(){
return{};
}
};
using tag2=PairSum<mint>;
struct actedxy{
using info=::sumxy;
using tag=::tag2;
using value_type=typename info::value_type;
using lazy_type=typename tag::value_type;
static value_type act(value_type a,lazy_type b,ll len){
return{a[0]+b.fi,a[1]+b.se,a[2]+a[0]*b.se+a[1]*b.fi+b.fi*b.se*len};
}
};
void solve(){
LL(n);
VC(ll,a,n);
lazy_segtree<acted>maxseg(n),minseg(n);
lazy_segtree<actedxy>xyseg(n);
vc<pii>mi{{-1,-1e9}},mx{{0,1e9}};
mint ans=0;
rep(i,n){
int pr=i;
while(mi.back().se>a[i]){
auto[R,val]=mi.back();mi.pop_back();
//[R,pr) が今から変わりましょう
minseg.apply(R,pr,-val+a[i]);
xyseg.apply(R,pr,pair<mint,mint>{-val+a[i],0});
pr=R;
}
int pr2=i;
while(mx.back().se<a[i]){
auto[R,val]=mx.back();mx.pop_back();
//[R,pr2) が今から変わりましょう
maxseg.apply(R,pr2,a[i]-val);
xyseg.apply(R,pr2,pair<mint,mint>{0,a[i]-val});
pr2=R;
}
mi.pb({pr,a[i]});
mx.pb({pr2,a[i]});
dbg(xyseg);
dbg(minseg.prod(0,i+1).se+maxseg.prod(0,i+1).se-2*xyseg.prod(0,i+1)[2]);
dbg(minseg);
dbg(maxseg);
ans+=minseg.prod(0,i+1).se+maxseg.prod(0,i+1).se-2*xyseg.prod(0,i+1)[2];
xyseg.set(i,{a[i],a[i],a[i]*a[i]});minseg.set(i,{a[i],a[i]*a[i]});maxseg.set(i,{a[i],a[i]*a[i]});
}
PRT(ans);
}
signed main(){
int t=1;
// cin >> t;
while(t--)solve();
}
ryoku