难度:3
这道题,只要统计出每条路走的次数,就可以了,但是难就难在这里,然后一开始用的办法是暴力法,超时,但是还不知道为什么这么写,回去看差分了,
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
const int N = 100005;
struct street {
ll a, b, c;
street(int a1 = 0, int b1 = 0, int c1 = 0): a(a1), b(b1), c(c1) {}
} str[N];
int main() {
int n, m;
cin >> n >> m;
int s[N];
ll cnt[N] = {};
for (int i = 0; i < m; i++) {
cin >> s[i];
if (i) {
int st = min(s[i], s[i - 1]);
int en = max(s[i], s[i - 1]);
cnt[st]++;
cnt[en]--;
}
}
for (int i = 1; i < n; i++) {
cnt[i] += cnt[i - 1];
}
for (int i = 1; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
str[i] = street(x, y, z);
}
ll ans = 0;
for (int i = 1; i < n; i++) {
if (cnt[i]) {
ans += min(cnt[i] * str[i].a, cnt[i] * str[i].b + str[i].c);
}
}
cout << ans;
return 0;
}