pat顶级1002 Business (35 分)

想试试PTA Top Level的难度，然后随便来了一题~ 1002 Business (35分) As the manager of your company, you have to carefully consider, for each project, the time taken to finish it, the deadline, and the profit you can gain, in order to decide if your group should take this .

As the manager of your company, you have to carefully consider, for each project, the time taken to finish it, the deadline, and the profit you can gain, in order to decide if your group should take this project. For example, given 3 projects as the follow

感想：动态规划真正的入门题，之前搞过一个d'p的但是不是很懂，现在算是理解了动态规划的本质是什么了 代码里有原来傻傻的我写的DFS 的方法，果断超时了。。。。。 #include #include #include #include #include #include #include using namespace std; int N; long MAXDAY=-1,MAXFPOF

1002. Business (35) 时间限制 800 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者 CHEN, Yue As the manager of your company, you have to carefu

1002 Business （35 分） As the manager of your company, you have to carefully consider, for each project, the time taken to finish it, the deadline, and the profit you can gain, in order to decide if yo...

动态规划——01背包 链接: https://pintia.cn/problem-sets/994805148990160896/problems/994805156145643520 1002 Business （35 分） As the manager of your company, you have to carefully consider, for each project, the...

题目   题意：有很多任务，完成任务可以获得受益，每个任务有所需时间和截至日期，不能同时做两个任务，问合理选择任务能达到的最大收益。   题解：显然01背包，把容量限制和截止日期限制取交集即可。但是要注意应该先按照截至日期从早到晚排序。因为同等容量下，把截至日期早的放后面的组合一定可以换成把截至日期放前面，反之不一定可以。所以排序后不会漏情况。   代码： #include<cst...

#include <iostream> #include <algorithm> #include <cstring> #include <cstdio> using namespace std; const int inf = 0x7FFFFFFF; const int maxn = 60; int N; struct Pro{ int ben...

1002 Business (35 分)

思路： 1.每份工作只有做和不做，问最大利润，自然就能想到0/1背包问题； 2.设dp[i][j]dp[i][j]dp[i][j]表示用jjj天的时间，在前iii个工程中所能获得的最大利润，设wk[i]wk[i]wk[i]为第iii个工作，wk[i].prowk[i].prowk[i].pro、wk[i].costwk[i].costwk[i].cost和wk[i].ddlwk[i].ddlwk...

思路 实质上是01背包问题。 本题用DFS暴力搜索绝对会超时，应当使用动态规划。 由于未指定D的最大值，故使用了map。   本文参考了：PAT (Top Level) Practise 1002 Business (35) 通过该链接，学到了给结构体添加成员函数，给结构体重载小于号操作符，利用map进行动态规划。 通过画面   代码 #define _CRT_SECUR...

As the manager of your company, you have to carefully consider, for each project, the time taken to finish it, the deadline, and the profit you can gain, in order to decide if your group should take this project. For example, given 3 projects as the follow

As the manager of your company, you have to carefully consider, for each project, the time taken to finish it, the deadline, and the profit you can gain, in order to decide if your group should take t...

As the manager of your company, you have to carefully consider, for each project, the time taken to finish it, the deadline, and the profit you can gain, in order to decide if your group should take t...

1002 Business （35 分） As the manager of your company, you have to carefully consider, for each project, the time taken to finish it, the deadline, and the profit you can gain, in order to decide if yo...

1002 Business 动态规划。 #include <bits/stdc++.h> using namespace std; #define inf 1000000000 struct node{ int p,l,d; }; bool cmp(node a,node b) { if(a.d!=b.d) return a.d<b.d; if(a.l!=b.l) ...

PAT顶级 1002 Business (35分) 排序+01背包 题解： 披着狼皮的01背包问题 首先我们将每个任务按照截止时间ddl升序排序 然后按照01背包做就可以啦~ 代码如下： #include<iostream> #include<algorithm> #include<stdio.h> #include<cmath> #includ...