Submission #72703130

---

Source Code Expand

#include <bits/stdc++.h>
const int maxn=5e5+5;
using namespace std;
int q,n;
int a[maxn];
int sum[maxn];
int lowbit(int x)
{
	return x&-x;
}
void upd(int x,int y)
{
	for (int i=x;i<=n;i+=lowbit(i))
		sum[i]+=y;
}
int qry(int x)
{
	int ret=0;
	for (int i=x;i;i-=lowbit(i))
		ret+=sum[i];
	return ret;
}
int main()
{
	cin >> n >> q;
	for (int i=1;i<=n;i++) cin >> a[i],upd(i,a[i]);
	for (int i=1;i<=q;i++)
	{
		int ch;
		cin >> ch;
		if (ch==1)
		{
			int x;
			cin >> x;
			int val1=a[x];
			int val2=a[x+1];
			upd(x,-val1);
			upd(x,val2);
			upd(x+1,val1);
			upd(x+1,-val2);
			swap(a[x],a[x+1]);
		}
		else
		{
			int l,r;
			cin >> l >> r;
			cout << qry(r)-qry(l-1) << endl;
		}
	}
	return 0;
}

Submission Info

Judge Result