通信线路.java 337 字节
Newer Older
qq_36480062's avatar
c  
qq_36480062 已提交
1 2 3 4 5
package graph.复合单源最短路;

import java.util.Scanner;

/**
qq_36480062's avatar
c  
qq_36480062 已提交
6 7
 * 从a到b,路径的长度定义为第k+1大值
 * 二分:
qq_36480062's avatar
c  
qq_36480062 已提交
8 9 10 11 12 13 14 15 16 17 18 19
 *
 */
public class 通信线路 {
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        m = sc.nextInt();
    }

    static int n, m;
}