HDU 5861

题意： 在一条线上有n个站，相邻站只有有条路，打开每天需要花费w[i],但是每条路只能开，关一次。有m天的行程，从ai到bi，问每一天的花费。

思路，找出每条路的最大和最小经过的日期，加到对应的答案区间。

代码：

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#include<vector>
#include<iostream>
#include<complex>
#include<string>
#include<set>
#include<map>
#include<algorithm>
//#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000")
#define nn 200200
#define mm 400200
//#define ll long long
#define ULL unsiged long long
#define pb push_back
#define mod 1000000007
#define inf 0x3fffffff
#define eps 0.00000001

int n, m;
int val[nn];
int ans[nn];
struct node
{
	int minn, maxx;
}t[nn<<2];
void build(int l, int r, int rt)
{
	t[rt].maxx = 0;
	t[rt].minn = inf;
	if (l == r) return;
	int  mid = (l + r) >> 1;
	build(l, mid, rt << 1);
	build(mid + 1, r, rt << 1 | 1);
}
void pushdown(int rt)
{
	if (t[rt].maxx)
	{
		t[rt << 1].minn = min(t[rt << 1].minn, t[rt].minn);
		t[rt << 1].maxx = max(t[rt << 1].maxx, t[rt].maxx);
		t[rt << 1 | 1].minn = min(t[rt << 1 | 1].minn, t[rt].minn);
		t[rt << 1 | 1].maxx = max(t[rt << 1 | 1].maxx, t[rt].maxx);
		t[rt].maxx = 0;
		t[rt].minn = inf;
	}
}

void updata(int ll, int rr, int val, int l, int r, int rt)
{
	
	if (ll <= l && r <= rr)
	{
		t[rt].maxx = max(t[rt].maxx, val);
		t[rt].minn = min(t[rt].minn, val);
		return;
	}
	//pushdown(rt);
	int mid = (l + r) >> 1;
	if (ll <= mid) updata(ll, rr, val, l, mid, rt << 1);
	if (rr > mid) updata(ll, rr, val, mid + 1, r, rt << 1 | 1);
}
int ansmin, ansmax;
void query(int l, int r, int rt, int x)
{
	if (l==r)
	{
		ansmin = t[rt].minn;
		ansmax = t[rt].maxx;
		return;
	}
	pushdown(rt);
	int mid = (l + r) >> 1;
	if (x <= mid) query(l, mid, rt << 1, x);
	else query(mid + 1, r, rt << 1 | 1, x);
}
int main()
{
	while (scanf("%d%d", &n, &m) != EOF)
	{
		for (int i = 1; i < n; i++) scanf("%d", &val[i]);
		memset(ans, 0, sizeof(ans));
		build(1, n, 1);
		for (int i = 0; i < m; i++)
		{
			int l, r;
			scanf("%d%d", &l, &r);
			if (l > r) swap(l, r);
			updata(l, r - 1, i + 1, 1, n, 1);
		}
		for (int i = 1; i < n; i++)
		{
			query(1, n, 1, i);
			if (ansmax == 0 || ansmin == inf) continue;
			ans[ansmin] += val[i];
			ans[ansmax + 1] -= val[i];
		}
		for (int i = 1; i <= m; i++)
			ans[i] += ans[i - 1];
		for (int i = 1; i <= m; i++)
			printf("%d\n", ans[i]);
	}
	return 0;
}