题意:有n个城市,有n-1条大路是从i到i+1的有向边,权值为qi。还有m条小路,起点u终点v权值w。有q次询问,给出起点终点,问从起点到终点的最短路,并且小路最多只能走一次。
题解:想了很久还是看了题解http://www.cnblogs.com/chanme/p/3634576.html。
首先要把所有小路和询问一起离线处理,排序时把起点大的放前面,起点相同终点小的放前面,终点相同路的插入放前面,然后分类讨论。
询问中如果u < v,那么就是相当于在所有小路起点u1 > u且终点v1 < v的情况中找一条节省最多的路替换掉再加上剩下大路就是最短路。
如果v < u,相当于在所有小路起点u1 > u且终点v1 < v的情况,也就是u -> u1 -> v1 -> v,也就是dist(u1,u)+cost(u1,v1)+dist(v,v1),可以转化为dist(v1,u1)-dist(v,u)+cost(u1,v1),dist(v,u)是常量,用树状数组维护dist(v1,u1)+cost(u1,v1)的最小值,结果减去dist(v,u)就可以了。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#define ll long long
using namespace std;
const int N = 100005;
const ll INF = (ll)1 << 60;
struct Path {
int u, v, flag;
ll c;
}p[N << 2];
int n, m, q;
ll sum[N], res[N << 1], C[N];
bool cmp(Path a, Path b) {
if (a.u != b.u)
return a.u > b.u;
if (a.v != b.v)
return a.v < b.v;
return a.flag < b.flag;
}
int lowbit(int x) {
return x & (-x);
}
void modify(int x, ll d) {
while (x <= n) {
C[x] = min(C[x], d);
x += lowbit(x);
}
}
ll query(int x) {
ll ret = INF;
while (x > 0) {
ret = min(C[x], ret);
x -= lowbit(x);
}
return ret;
}
int main() {
while (scanf("%d%d", &n, &m) == 2) {
memset(res, 0, sizeof(res));
sum[1] = 0;
ll temp;
for (int i = 2; i <= n; i++) {
scanf("%lld", &temp);
sum[i] = sum[i - 1] + temp;
}
for (int i = 1; i <= m; i++) {
scanf("%d%d%lld", &p[i].u, &p[i].v, &p[i].c);
p[i].flag = 0;
}
scanf("%d", &q);
for (int i = 1; i <= q; i++) {
scanf("%d%d", &p[i + m].u, &p[i + m].v);
p[i + m].c = i;
p[i + m].flag = 1;
}
int cnt = m + q;
sort(p + 1, p + 1 + cnt, cmp);
memset(C, 0, sizeof(C));
for (int i = 1; i <= cnt; i++) {
if (p[i].flag == 0 && p[i].u < p[i].v)
modify(p[i].v, p[i].c - (sum[p[i].v] - sum[p[i].u]));
if (p[i].flag == 1 && p[i].u < p[i].v)
res[p[i].c] = query(p[i].v) + sum[p[i].v] - sum[p[i].u];
}
for (int i = 1; i <= n; i++)
C[i] = INF;
for (int i = 1; i <= cnt; i++) {
if (p[i].flag == 0 && p[i].u > p[i].v)
modify(p[i].v, p[i].c + sum[p[i].u] - sum[p[i].v]);
if (p[i].flag == 1 && p[i].u > p[i].v)
res[p[i].c] = query(p[i].v) - (sum[p[i].u] - sum[p[i].v]);
}
for (int i = 1; i <= q; i++)
printf("%lld\n", res[i]);
}
return 0;
}