中文题。。。。。。但并不是很好做。。。。。
物品看做一个点,酋长为源点,设置一个超级汇点,所有在与酋长等级限制之内的物品可以连向汇点,从酋长出发求最短路。
可交换的就在a,b之间连一条权值为剩余价值的路
但是存在等级限制所以要枚举每一个区间求最短路,最小的那个即为所求。走的路要在等级限制内
链接:poj 1062
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <queue>
#include <cmath>
#define INF 0x3f3f3f3f
#define maxn 510
#define maxm 10007
using namespace std;
struct node
{
int v, next;
int w;
} es[maxm];
int n, m, s;
int head[maxn];
int dis[maxn];
int cnt[maxn];
int vis[maxn];
int lv[maxn];
int nodep, top, ans;
void addedge(int u, int v, int w)
{
es[nodep].v = v;
es[nodep].w = w;
es[nodep].next = head[u];
head[u] = nodep++;
}
bool spfa()
{
memset(vis, 0, sizeof(vis));
memset(cnt, 0, sizeof(cnt));
for(int i = 0; i <= n; ++i)
dis[i] = INF;
vis[s] = 1;
dis[s] = 0;
queue<int> que;
que.push(s);
cnt[s]++;
while(!que.empty()) {
int u = que.front();
que.pop();
vis[u] = 0;
for(int i = head[u]; i + 1; i = es[i].next) {
int v = es[i].v;
if(dis[v] > dis[u] + es[i].w && lv[v] <= top && lv[v] >= top - m) {
dis[v] = dis[u] + es[i].w;
if(!vis[v]) {
vis[v] = 1;
que.push(v);
//if(++cnt[v] > n)return 0;
}
}
}
}
//cout<<dis[0]<<endl;
ans = min(ans, dis[0]);
return 1;
}
int main()
{
while(scanf("%d %d", &m, &n) != EOF) {
nodep = 0;
memset(head, -1, sizeof(head));
int x, y, a, b, c;
int w, PP;
for(a = 1; a <= n; ++a) {
int w, p, k;
scanf("%d %d %d", &w, &p, &k);
lv[a] = p;
if(a == 1) PP = p;
if(PP - p <= m)
addedge(a, 0, w);
for(int j = 0; j < k; ++j) {
int v;
scanf("%d %d", &b, &v);
addedge(a, b, v);
}
}
lv[0] = PP;
ans = INF;
s = 1;
for(top = PP; top <= PP + m; ++top)
spfa();
cout << ans << endl;
}
return 0;
}