计算机算法设计与分析 3-23 K中值问题

最新推荐文章于 2021-05-24 20:39:38 发布

原创

最新推荐文章于 2021-05-24 20:39:38 发布 · 2.2k 阅读

11 ·

CC 4.0 BY-SA版权

文章标签：

#ACM #算法 #动态规划

在这里插入图片描述

解题方法

显然是个dp题, 不过是dp的方程不太容易想到罢了
明天再写吧好累了,先贴代码

/*
 * Copyright (c) 2019 Ng Kimbing, HNU, All rights reserved. May not be used, modified, or copied without permission.
 * @Author: Ng Kimbing, HNU.
 * @LastModified:2019-05-14 T 21:15:57.514 +08:00
 */
package ACMProblems.DynamicProgramming;

import MyUtil.Matrix;

import java.io.FileInputStream;

import static ACMProblems.ACMIO.*;

public class ServicePointInLine {
   
   
    private static int n;
    private static int maxStationNum;
    private static int[] x;
    private static int[] w;
    private static int[] c;
    private static int[] sumW;
    private static int[] sumOfWiMultiD1i;
    private static int[][] dp1;
    private static int[][] dp2;

    private static void inputData() throws Exception {
   
   
        setStream(new FileInputStream("serviceData.txt"));
        n = nextInt();
        maxStationNum = nextInt();
        x = new int[n + 1];
        w = new int[n + 1];
        c = new int[n + 1];
        sumW = new int