zoj 3724 树状数组

想了好久都想不到，看了大牛的题解才略懂

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <map>

using namespace std;
#define ll long long 
#define inf 0x3f3f3f3f
#define mod 1000000007
#define eps 1e-8
#define N 1000010
#define M 330

int n,m,q;
struct Node
{
	int u,v,w,id;
	Node(){}
	Node(int _u,int _v,int _w,int _id)
		:u(_u),v(_v),w(_w),id(_id){}

}arr[N],brr[N];
int la,lb;
bool cmp1(Node a,Node b)
{
	if(a.v==b.v) return a.id<b.id;
	return a.v<b.v;
}
bool cmp2(Node a,Node b)
{
	if(a.v==b.v) return a.id<b.id;
	return a.v>b.v;
}

ll crr[N],sum[N];
ll ans[N];

void update(int pos,ll x)
{
	while(pos>0)
	{
		crr[pos] = min(crr[pos],x);
		pos -= pos&(-pos);
	}

}
ll query(int pos)
{
	ll ret = 1LL<<62;
	while(pos<=n)
	{
		ret = min(ret,crr[pos]);
		pos += pos&(-pos);
	}
	return ret;
}
void update2(int pos,ll x)
{
	while(pos<=n)
	{
		crr[pos] = min(crr[pos],x);
		pos += pos&(-pos);
	}

}
ll query2(int pos)
{
	ll ret = 1LL<<62;
	while(pos)
	{
		ret = min(ret,crr[pos]);
		pos -= pos&(-pos);
	}
	return ret;
}

int main()
{
	//freopen("a.in","r",stdin);
	int a,b,c;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		sum[1] = 0;
		for(int i=2;i<=n;i++)
			scanf("%lld",sum+i),sum[i] += sum[i-1];
		la = lb = 0;
		for(int i=0;i<m;i++)
		{
			scanf("%d%d%d",&a,&b,&c);
			if(a<=b)
				arr[la++] = Node(a,b,c,0);
			else
				brr[lb++] = Node(b,a,c,0);
		}
		scanf("%d",&q);
		for(int i=1;i<=q;i++)
		{
			scanf("%d%d",&a,&b);
			if(a<=b)
				arr[la++] = Node(a,b,0,i);
			else
				brr[lb++] = Node(b,a,0,i);
		}
		sort(arr,arr+la,cmp1);
		sort(brr,brr+lb,cmp2);
		memset(crr,0x3f,sizeof(crr));
		for(int i=1,j=0;i<=n;i++)
		{
			while(j<la&&arr[j].v<=i)
			{
				if(arr[j].id)
				{
					ans[arr[j].id] = sum[arr[j].v]-sum[arr[j].u];
					ll tmp = query(arr[j].u);
					if(tmp<0)
						ans[arr[j].id] += tmp;

				}
				else
				{
					update(arr[j].u,arr[j].w-(sum[arr[j].v]-sum[arr[j].u]));
				}
				++j;
			}
		}

		memset(crr,0x3f,sizeof(crr));
		for(int i=n,j=0;i>=1;i--)
		{
			while(j<lb&&brr[j].v>=i)
			{
				if(brr[j].id)
				{
					ans[brr[j].id] = sum[n]-(sum[brr[j].v]-sum[brr[j].u])+query2(brr[j].u);
					
				}
				else
				{
					update2(brr[j].u,brr[j].w-sum[n]+(sum[brr[j].v]-sum[brr[j].u]));
				}
				++j;
			}
		}
		for(int i=1;i<=q;i++)
			printf("%lld\n",ans[i]);
	}

}