题目大意是选一条路从一到N有电话线要你连起来,但是电话线公司只给你报销K根线的费用,你搭建的最后费用是你搭建的所有线中最长那根线的长度。
问你怎么搭建可以使费用最小,就是等与要你求这条路线里第K+1长的线
很明显二分答案,然后用最短路跑一边判断是第几大的线
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define N 1005
using namespace std;
int num = 0 , n,m,k,adj[N],f[N],q[N],d[N];
struct Edge
{
int v,w,c,pre;
}e[20*N];
void insert(int u,int v,int w)
{
e[num].v = v;
e[num].c = w;
e[num].pre = adj[u];
adj[u] = num++;
}
int spfa(int x)
{
int i,v,head = 0 , tail = 0;
memset(f,0,sizeof(f));
memset(d,0x7f,sizeof(d));
d[x] = 0;
q[++tail] = x;
while(head != tail){
x = q[head = (head+1)%N];
f[x] = 0;
for(int i=adj[x];~i;i = e[i].pre){
if(d[v=e[i].v] > d[x] + e[i].w){
d[v] = d[x] + e[i].w;
if(!f[v]){
f[v] = 1;
q[tail = (tail+1)%N] = v;
}
}
}
}
return d[n] <= k;
}
int ok(int x)
{
for(int i=1;i<=n;i++){
for(int j=adj[i];~j;j = e[j].pre){
if(e[j].c <= x){
e[j].w = 0;
}else e[j].w = 1;
}
}
return spfa(1);
}
int main()
{
int u,v,w;
while(~scanf("%d%d%d",&n,&m,&k)){
num = 0;
memset(adj,-1,sizeof(adj));
int l = 0 , r = 0 ,mid , ans = -1;
for(int i=0;i<m;i++){
scanf("%d%d%d",&u,&v,&w);
insert(u,v,w);
insert(v,u,w);
if(w>r) r = w;
}
while(l<=r){
mid = (l+r)>>1;
if(ok(mid)){
ans = mid;
r = mid - 1;
}else l = mid + 1;
}
printf("%d\n",ans);
}
return 0;
}
主要这题是模板题,所以我参考了别人的代码