#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"
// ==========================(debug)============================================================================================== //
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif
void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// ==========================(debug)============================================================================================== //
ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;
// ==========================(MOD)=============================================================================================== //
ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }
// ==========================(MOD)=============================================================================================== //
bool f = false;
ll a[mx];
typedef struct NODE{
ll v[2][2];
ll b[2];
}node;
node merge(node aa,node bb){
node pp;
pp.b[0] = aa.b[0];
pp.b[1] = bb.b[1];
fip(0,2)
fjp(0,2){
pp.v[i][j] = -1e18;
fp(xx,0,2)
fp(yy,0,2) {
if(xx&yy){
if((aa.b[1]>0) == (bb.b[0]>0))
pp.v[i][j] = max(pp.v[i][j],abs(aa.v[i][xx])+abs(bb.v[yy][j]));
}else
pp.v[i][j] = max(pp.v[i][j],abs(aa.v[i][xx])+abs(bb.v[yy][j]));
}
}
return pp;
}
typedef struct SEGMENT_TREE{
vector<node> arr;
ll range;
void init(ll k){
range = log2(k);
range = 1 << (range + 3);
arr.resize(range);
return;
}
void construct(ll ptr,ll l,ll r){
if(l==r){
fip(0,2)
fjp(0,2)
arr[ptr].v[i][j] = 0;
arr[ptr].v[1][1] = (a[l+1]-a[l]);
arr[ptr].b[0] = arr[ptr].b[1] = (a[l+1]-a[l]);
return;
}
ll mid = l + (r-l) / 2;
construct(2*ptr,l,mid);
construct(2*ptr+1,mid+1,r);
arr[ptr] = merge(arr[2*ptr],arr[2*ptr+1]);
return ;
}
void update(ll ptr,ll l,ll r,ll idx,ll val){
if(l==r && l==idx){
arr[ptr].v[1][1] += val;
arr[ptr].b[0] += val;
arr[ptr].b[1] += val;
return;
}
if(l>idx || r<idx)
return;
ll mid = l + (r-l) / 2;
update(2*ptr,l,mid,idx,val);
update(2*ptr+1,mid+1,r,idx,val);
arr[ptr] = merge(arr[2*ptr],arr[2*ptr+1]);
return;
}
ll query(){
range = -1e18;
fip(0,2)fjp(0,2)
range = max(range,arr[1].v[i][j]);
return range;
}
void deb(ll ptr,ll l,ll r){
cerr<<ptr<<" "<<l<<" "<<r<<nli;
fip(0,2)
fjp(0,2)
cerr<<i<<" "<<j<<" "<<arr[ptr].v[i][j]<<nli;
cerr<<nli;
if(l==r)
return;
ll mid = l + (r-l) / 2;
deb(2*ptr,l,mid);
deb(2*ptr+1,mid+1,r);
return;
}
}SGT;
SGT sgt;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input1.txt", "r", stdin);
// freopen("output1.txt", "w", stdout);
// freopen("error1.txt", "w", stderr);
// #endif // ONLINE_JUDGE
cin>>n>>m;
sgt.init(n);
fip(0,n)
cin>>a[i];
sgt.construct(1,0,n-2);
// fip(0,n-1)
// sgt.update(1,0,n-2,i,a[i+1]-a[i]);
// sgt.deb(1,0,n-2);
while(m--){
cin>>tp>>tp2;
cin>>res;
tp--;
tp2--;
sgt.update(1,0,n-2,tp-1,res);
sgt.update(1,0,n-2,tp2,-res);
ans = sgt.query();
// sgt.deb(1,0,n-2);
cout<<ans<<nli;
}
cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
6 ms |
1368 KB |
Output is correct |
| 8 |
Correct |
6 ms |
1372 KB |
Output is correct |
| 9 |
Correct |
6 ms |
1372 KB |
Output is correct |
| 10 |
Correct |
6 ms |
1372 KB |
Output is correct |
| 11 |
Correct |
6 ms |
1396 KB |
Output is correct |
| 12 |
Correct |
6 ms |
1372 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
6 ms |
1368 KB |
Output is correct |
| 8 |
Correct |
6 ms |
1372 KB |
Output is correct |
| 9 |
Correct |
6 ms |
1372 KB |
Output is correct |
| 10 |
Correct |
6 ms |
1372 KB |
Output is correct |
| 11 |
Correct |
6 ms |
1396 KB |
Output is correct |
| 12 |
Correct |
6 ms |
1372 KB |
Output is correct |
| 13 |
Correct |
599 ms |
61256 KB |
Output is correct |
| 14 |
Correct |
579 ms |
61524 KB |
Output is correct |
| 15 |
Correct |
556 ms |
60844 KB |
Output is correct |
| 16 |
Correct |
558 ms |
60788 KB |
Output is correct |
| 17 |
Correct |
594 ms |
60684 KB |
Output is correct |
| 18 |
Correct |
517 ms |
61696 KB |
Output is correct |
