ICPC2018徐州网络赛 H.Ryuji doesn't want to study ( 树状数组

最新推荐文章于 2019-08-14 21:08:49 发布

Yishui_Blog

最新推荐文章于 2019-08-14 21:08:49 发布

阅读量178

点赞数

本文链接：https://blog.csdn.net/wang2332/article/details/82696089

版权

网赛套题同时被 2 个专栏收录

14 篇文章 0 订阅

订阅专栏

数据结构树状数组

11 篇文章 0 订阅

订阅专栏

题意：

求 $KaTeX parse error: No such environment: equation* at position 7: \begin{̲e̲q̲u̲a̲t̲i̲o̲n̲*̲}̲ \sum_{i=l}^ra_…$

考虑化简公式利用前缀和化简为 $KaTeX parse error: No such environment: equation* at position 7: \begin{̲e̲q̲u̲a̲t̲i̲o̲n̲*̲}̲ \sum_{i=l}^ra_…$ - $KaTeX parse error: No such environment: equation* at position 7: \begin{̲e̲q̲u̲a̲t̲i̲o̲n̲*̲}̲ (n-r)*\sum_{i=…$

这样只需要考虑维护两个数的前缀和就可以了


#include <bits/stdc++.h>
using namespace std;

#define cpp_io() {ios::sync_with_stdio(false); cin.tie(NULL);}
#define rep(i,a,n) for (int i=a;i<n;i++)
#define repp(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define CLR(a,b) memset(a,(b),sizeof(a))
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ls o<<1
#define rs o<<1|1

typedef long long ll;
typedef vector<int> VI;
const int MAXN = (int)2e5+10;
const int INF = 0x3f3f3f3f;
const int mod = (int)998244353;

ll a[MAXN], c[MAXN], cc[MAXN], n, q;
ll lowbit(ll x) { return x&-x; }
ll query(ll p) {ll res=0; while(p) res+=c[p],p-=lowbit(p); return res;}
void add(ll x,ll p) { while(p<=n) c[p]+=x, p+=lowbit(p); }
ll query_1(ll p) {ll res=0; while(p) res+=cc[p],p-=lowbit(p); return res;}
void add_1(ll x,ll p) { while(p<=n) cc[p]+=x, p+=lowbit(p); }

int main() {
    cpp_io();
    cin>>n>>q;
    for(ll i=1;i<=n;++i) {
        cin>>a[i];
        add(a[i],i*1LL); add_1(1LL*a[i]*(n-i+1),i*1LL);
    }
    while(q--){
        ll op,l,r;
        cin>>op>>l>>r;
        if(op==1){
            cout<<1LL*(query_1(r)-query_1(l-1)-((n-r)*(query(r)-query(l-1))))<<endl;
        }
        else {
            add(r-a[l],l);
            add_1(1LL*(r-a[l])*(n-l+1),l);
            a[l]=r;
        }
    }
    return 0;
}