要先分段枚举,在分别进行一次Dijkstra。例如M=2,酋长等级为3,则要分别枚举1~3、2~4、3~5。#include<iostream>#include<stdio.h>#include<string.h>#include<queue>#include<vector>#define INF 0x3f3f3f3f#define MAXD 110using namespace std;int N,M,graph[MAXD][MAXD],P,L,X,T,V,limit[MAXD],value[MAXD];int min(int a, Read More