洛谷P1462 通往奥格瑞玛的道路

思路就是二分 + 最大路
二分钱财 和 血最大的路即可~~
找不存在的点只需把 r开到 1e9 + 1就行 因为最大的就 1e9 hhh

#include<cstdio>
#include<iostream>
#include<cstring>

using namespace std;

const int N = 1e5 + 10,M = 1e6 + 10;

int n,m,blood;
int a[N];

int head[N],to[M],last[M],w[M],cnt;
void add(int a,int b,int c){
	to[++cnt] = b;
	w[cnt] = c;
	last[cnt] = head[a];
	head[a] = cnt;
}

int dist[N],flag[N],q[N],num[N];
bool spfa(int mid){//超过mid 的删除掉 储存最多血量就完事了 
	for(int i = 1; i <= n; i++){
		dist[i] = 0;
		flag[i] = 0;
		num[i] = 0;
	}
	int hh = 0,tt = 0;
	q[++tt] = 1;
	dist[1] = blood;
	while(hh != tt){
		int p = q[++hh];
		if(hh == N - 1) hh = 0;
		flag[p] = 0;
		for(int i = head[p]; i != -1; i = last[i]){
			int j = to[i];
			if(a[j] > mid) continue;
			if(dist[j] < dist[p] - w[i]){
				dist[j] = dist[p] - w[i];
				num[j] = num[i] + 1;
				if(num[j] >= n) return true;
				if(!flag[j]){
					flag[j] = 1;
					q[++tt] = j;
					if(tt == N - 1) tt = 0;
				}
			}
		}
	} 
	if(dist[n] > 0) return true;
	return false;
}


int main(){
	memset(head,-1,sizeof head);
	scanf("%d%d%d",&n,&m,&blood);
	for(int i = 1; i <= n; i++){
		scanf("%d",&a[i]);
	}
	
	int x,y,z;
	for(int i = 1; i <= m; i++){
		scanf("%d%d%d",&x,&y,&z);
		add(x,y,z);
		add(y,x,z);
	}
	
	int l = 0,r = 1e9 + 1;
	while(l < r){
		int mid = l + r >> 1;
		if(spfa(mid)){
			r = mid;
		}else{
			l = mid + 1;
		}
	}
	
	if(r == 1e9 + 1) cout << "AFK" << endl;
	else cout << r << endl; 
	return 0;
}