POJ 3616 Milking Time

最新推荐文章于 2024-10-01 18:51:18 发布

DMDMCAR

最新推荐文章于 2024-10-01 18:51:18 发布

阅读量239

点赞数

分类专栏： # 动态规划文章标签： java

本文链接：https://blog.csdn.net/ZDQQQqq/article/details/124234152

版权

动态规划专栏收录该内容

4 篇文章 0 订阅

订阅专栏

编程语言：Java
题目链接：http://poj.org/problem?id=3616
题解：初始时间升序排列，后续不解释了，代码比较容易看懂
结果：AC

import java.io.*;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main {
    static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
    static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
    static Scanner sc = new Scanner(new BufferedInputStream(System.in));


    public static void main(String[] args) throws IOException {
        int n = sc.nextInt();
        int m = sc.nextInt();
        int r = sc.nextInt();
        cow[] a = new cow[m];
        int[] dp = new int[m];
        for (int i = 0; i < m; i++) {
            int s = sc.nextInt();
            int e = sc.nextInt();
            int num = sc.nextInt();
            a[i] = new cow(s, e + r, num);
        }
        Arrays.sort(a, new Comparator<cow>() {
            @Override
            public int compare(cow o1, cow o2) {
                return o1.start - o2.start;
            }
        });
        for (int i = 0; i < m; i++) {
            dp[i] = a[i].num;
            for (int j = 0; j < m; j++) {
                if (a[j].end <= a[i].start) {
                    dp[i] = Math.max(dp[i], dp[j] + a[i].num);
                }
            }
        }
        int max = 0;
        for (int i = 0; i < m; i++) {
            if (dp[i] > max) max = dp[i];
        }
        out.println(max);
        out.flush();
    }
}

class cow {
    int start;
    int end;
    int num;

    public cow(int start, int end, int num) {
        this.start = start;
        this.end = end;
        this.num = num;
    }
}