死于update的一個long long寫成int了

真的不想寫過程了 ********

樹狀數組，一個平的一個斜著的，怎么斜都行

題庫鏈接：https://nanti.jisuanke.com/t/31460

#include <iostream> #include <cstring>#define ll long long #define lowbit(x) (x & -x)using namespace std;const int maxn = 1e5 + 20; int n, m; ll t[maxn]; ll t1[maxn]; ll ans[maxn];ll search(int pos, int r) {ll sum = 0;r = n - r;while (pos){sum += t[pos];sum -= r * t1[pos];pos -= lowbit(pos);}return sum; }void update(int pos, int val) {int x = pos;while (pos <= n){t[pos] += (n - x + 1) * val;t1[pos] += val;pos += lowbit(pos);} }void update1(int pos, ll val) {val = val - search(pos, pos) + search(pos - 1,pos);int x = pos;while (pos <= n){t[pos] += (n - x + 1) * val;t1[pos] += val;pos += lowbit(pos);} }void init() {memset(t, 0, sizeof(t));memset(t1, 0, sizeof(t1));for (int i = 1; i <= n; i++)update(i, ans[i]); }int main() {ios::sync_with_stdio(false);cin >> n >> m;for (int i = 1; i <= n; i++)cin >> ans[i];init();while (m--){int op;ll a, b;cin >> op >> a >> b;if (op == 1)cout << search(b, b) - search(a - 1, b) << endl;elseupdate1(a, b);}return 0; }

?

轉載于:https://www.cnblogs.com/qq965921539/p/9623617.html

總結

以上是生活随笔為你收集整理的ACM-ICPC 2018徐州网络赛-H题 Ryuji doesn't want to study的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。