結果

問題 No.776 A Simple RMQ Problem
ユーザー やむなく
提出日時 2019-01-14 20:12:25
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 1,154 ms / 3,000 ms
コード長 4,202 bytes
コンパイル時間 1,939 ms
コンパイル使用メモリ 173,476 KB
実行使用メモリ 13,824 KB
最終ジャッジ日時 2024-06-23 00:42:19
合計ジャッジ時間 20,565 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(a) max((a),-(a))
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repe(i,n) rep(i,(n)+1)
#define per(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define pere(i,n) rep(i,(n)+1)
#define all(x) (x).begin(),(x).end()
#define SP <<" "<<
#define RET return 0
#define MOD 1000000007
#define INF 1000000000000000
typedef long long LL;
typedef long double LD;
struct LazySegmentTree {
private:
int n;
vector<LL> maxnode, minnode, maxrange, lazy, a;
public:
LazySegmentTree(vector<LL> v) {
a=v;
int sz = (int)v.size()+1;
n = 1; while(n < sz) n *= 2;
maxnode.resize(2*n-1,-INF);
minnode.resize(2*n-1,INF);
maxrange.resize(2*n-1,-INF);
lazy.resize(2*n-1, 0);
maxnode[n-1]=minnode[n-1]=0;
for(int i=1; i<sz; i++){
maxnode[i+n-1]=minnode[i+n-1]=maxnode[i+n-2]+v[i-1];
}
for(int i=n-2; i>=0; i--){
maxnode[i] = max(maxnode[i*2+1],maxnode[i*2+2]);
minnode[i] = min(minnode[i*2+1],minnode[i*2+2]);
maxrange[i] = max(max(maxrange[i*2+1],maxrange[i*2+2]),maxnode[i*2+2]-minnode[i*2+1]);
}
}
void disp(){
for(int i=0;i<maxnode.size();i++){
cout << maxnode[i] << " ";
}
cout << endl;
for(int i=0;i<maxnode.size();i++){
cout << minnode[i] << " ";
}
cout << endl;
for(int i=0;i<maxnode.size();i++){
cout << maxrange[i] << " ";
}
cout << endl;
}
void eval(int k, int l, int r) {
if(lazy[k] != 0) {
maxnode[k] += lazy[k];
minnode[k] += lazy[k];
if(r - l > 1) {
lazy[2*k+1] += lazy[k];
lazy[2*k+2] += lazy[k];
}
lazy[k] = 0;
}
}
void set(int id, LL x){
add(id+1,n,x-a[id]);
a[id]=x;
}
void add(int a, int b, LL x, int k=0, int l=0, int r=-1) {
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return;
if(a <= l && r <= b) {
lazy[k] += x;
eval(k, l, r);
}else{
add(a, b, x, 2*k+1, l, (l+r)/2);
add(a, b, x, 2*k+2, (l+r)/2, r);
maxnode[k]=max(maxnode[2*k+1],maxnode[2*k+2]);
minnode[k]=min(minnode[2*k+1],minnode[2*k+2]);
maxrange[k]=max(max(maxrange[k*2+1],maxrange[k*2+2]),maxnode[k*2+2]-minnode[k*2+1]);
}
}
LL getmin(int a, int b, int k=0, int l=0, int r=-1) {
if(r < 0) r = n;
if(b <= l || r <= a) return INF;
eval(k, l, r);
if(a <= l && r <= b) return minnode[k];
LL vl = getmin(a, b, 2*k+1, l, (l+r)/2);
LL vr = getmin(a, b, 2*k+2, (l+r)/2, r);
return min(vl,vr);
}
LL getmax(int a, int b, int k=0, int l=0, int r=-1) {
if(r < 0) r = n;
if(b <= l || r <= a) return -INF;
eval(k, l, r);
if(a <= l && r <= b) return maxnode[k];
LL vl = getmax(a, b, 2*k+1, l, (l+r)/2);
LL vr = getmax(a, b, 2*k+2, (l+r)/2, r);
return max(vl,vr);
}
LL getmaxrange(int a, int b, int k=0, int l=0, int r=-1){
if(r < 0) r = n;
if(b <= l || r <= a) return -INF;
eval(k, l, r);
if(a <= l && r <= b) return maxrange[k];
LL vl = getmaxrange(a, b, 2*k+1, l, (l+r)/2);
LL vr = getmaxrange(a, b, 2*k+2, (l+r)/2, r);
return max(max(vl,vr),getmax(a, b, 2*k+2, (l+r)/2, r)-getmin(a, b, 2*k+1, l, (l+r)/2));
}
};
int main(){
int n,q;
cin >> n >> q;
vector<LL> a(n);
for(int i=0;i<n;i++) cin >> a[i];
LazySegmentTree seg(a);
// seg.disp();
string s;
for(int t=0;t<q;t++){
cin >> s;
if(s=="set"){
int id,x;
cin >> id >> x;
id--;
seg.set(id,x);
}else{
int l1,l2,r1,r2;
cin >> l1 >> l2 >> r1 >> r2;
l1--,l2--,r1--,r2--;
r1=max(r1,l1);
l2=min(l2,r2);
// cout << l1 SP l2 SP r1 SP r2 << endl;
if(l2<r1){
cout << seg.getmax(r1+1,r2+2)-seg.getmin(l1,l2+1) << endl;
}else{
// cout << seg.getmax(r1+1,r2+2) SP seg.getmin(l1,r1) << endl;
// cout << seg.getmax(l2+2,r2+2) SP seg.getmin(l1,l2+1) << endl;
// cout << seg.getmaxrange(r1,l2+2) << endl;
cout << max(max(seg.getmax(r1+1,r2+2)-seg.getmin(l1,r1),seg.getmax(l2+2,r2+2)-seg.getmin(l1,l2+1)),seg.getmaxrange(r1,l2+2)) << endl;
}
}
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0