#include <bits/stdc++.h>
// cut here
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
int bsf(unsigned int n) {
#ifdef _MSC_VER
unsigned long index;
_BitScanForward(&index, n);
return index;
#else
return __builtin_ctz(n);
#endif
}
} // namespace internal
} // namespace atcoder
namespace atcoder {
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
public:
segtree() : segtree(0) {}
segtree(int n) : segtree(std::vector<S>(n, e())) {}
segtree(const std::vector<S>& v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
for (int i = 0; i < _n; i++) d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
d[p] = x;
for (int i = 1; i <= log; i++) update(p >> i);
}
S get(int p) {
assert(0 <= p && p < _n);
return d[p + size];
}
S prod(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
S sml = e(), smr = e();
l += size;
r += size;
while (l < r) {
if (l & 1) sml = op(sml, d[l++]);
if (r & 1) smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1]; }
template <bool (*f)(S)> int max_right(int l) {
return max_right(l, [](S x) { return f(x); });
}
template <class F> int max_right(int l, F f) {
assert(0 <= l && l <= _n);
assert(f(e()));
if (l == _n) return _n;
l += size;
S sm = e();
do {
while (l % 2 == 0) l >>= 1;
if (!f(op(sm, d[l]))) {
while (l < size) {
l = (2 * l);
if (f(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*f)(S)> int min_left(int r) {
return min_left(r, [](S x) { return f(x); });
}
template <class F> int min_left(int r, F f) {
assert(0 <= r && r <= _n);
assert(f(e()));
if (r == 0) return 0;
r += size;
S sm = e();
do {
r--;
while (r > 1 && (r % 2)) r >>= 1;
if (!f(op(d[r], sm))) {
while (r < size) {
r = (2 * r + 1);
if (f(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
} // namespace atcoder
// cut here
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _31av4qi ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
const int inf=1e9;
struct node{
vec(vec(ll)) val;
ll _front,_back;
void init(ll __front,ll __back,vec(vec(ll)) _val){
_back=__back;
_front=__front;
val=_val;
}
node e(){
node _e;
_e.init(-inf,-inf,{
{0,-inf},
{-inf,0}
});
return _e;
}
};
bool isvalid(node l,int type){
if(type==0){
return l._front!=-inf;
}else{
return l._back!=-inf;
}
}
node op(node l,node r){
node now;
now.init(l._front,r._back,now.e().val);
rep(tl,2)rep(tr,2){
ll merged,additional=0;
if(isvalid(l,1) and isvalid(r,0)){
additional=max(0ll,+l._back-r._front);
}
merged=l.val[tl][0]+r.val[0][tr]+additional; // both positive
now.val[tl][tr]=max(now.val[tl][tr],merged);
additional=0;
if(isvalid(l,1) and isvalid(r,0)){
additional=max(0ll,-l._back+r._front);
}
merged=l.val[tl][1]+r.val[1][tr]+additional; // both negative
now.val[tl][tr]=max(now.val[tl][tr],merged);
merged=l.val[tl][0]+r.val[1][tr];
now.val[tl][tr]=max(now.val[tl][tr],merged);
merged=l.val[tl][1]+r.val[0][tr];
now.val[tl][tr]=max(now.val[tl][tr],merged);
}
return now;
}
node e(){
node _e;
return _e.e();
}
int main(){
_31av4qi;
int n;
cin>>n;
int q;
cin>>q;
vec(ll) a(n);
rep(i,n){
cin>>a[i];
}
atcoder::segtree<node,op,e> seg(n);
rep(i,n){
node now;
now.init(a[i],a[i],now.e().val);
seg.set(i,now);
}
auto f_all=[&](int l,int r)->ll{
node now=seg.prod(l,r);
ll ans=-inf;
rep(t,2)rep(t1,2){
ans=max(ans,now.val[t][t1]);
}
return ans;
};
rep(_,q){
int l,r,x;
cin>>l>>r>>x;
l--,r--;
crep(j,l,r+1){
a[j]+=x;
node now;
now.init(a[j],a[j],now.e().val);
seg.set(j,now);
}
ll ans=f_all(0,n);
cout<<ans<<"\n";
}
//
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
242 ms |
448 KB |
Output is correct |
| 2 |
Correct |
163 ms |
420 KB |
Output is correct |
| 3 |
Correct |
160 ms |
432 KB |
Output is correct |
| 4 |
Correct |
172 ms |
436 KB |
Output is correct |
| 5 |
Correct |
168 ms |
332 KB |
Output is correct |
| 6 |
Incorrect |
170 ms |
424 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
242 ms |
448 KB |
Output is correct |
| 2 |
Correct |
163 ms |
420 KB |
Output is correct |
| 3 |
Correct |
160 ms |
432 KB |
Output is correct |
| 4 |
Correct |
172 ms |
436 KB |
Output is correct |
| 5 |
Correct |
168 ms |
332 KB |
Output is correct |
| 6 |
Incorrect |
170 ms |
424 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
242 ms |
448 KB |
Output is correct |
| 2 |
Correct |
163 ms |
420 KB |
Output is correct |
| 3 |
Correct |
160 ms |
432 KB |
Output is correct |
| 4 |
Correct |
172 ms |
436 KB |
Output is correct |
| 5 |
Correct |
168 ms |
332 KB |
Output is correct |
| 6 |
Incorrect |
170 ms |
424 KB |
Output isn't correct |
