POJ [USACO] Chores
来源:互联网 发布:linux查找路径命令 编辑:程序博客网 时间:2024/05/18 22:13
Description
Farmer John’s family pitches in with the chores during milking, doing all the chores as quickly as possible. At FJ’s house, some chores cannot be started until others have been completed, e.g., it is impossible to wash the cows until they are in the stalls.
Farmer John has a list of N (3 <= N <= 10,000) chores that must be completed. Each chore requires an integer time (1 <= length of time <= 100) to complete and there may be other chores that must be completed before this chore is started. We will call these prerequisite chores. At least one chore has no prerequisite: the very first one, number 1. Farmer John’s list of chores is nicely ordered, and chore K (K > 1) can have only chores 1,.K-1 as prerequisites. Write a program that reads a list of chores from 1 to N with associated times and all perquisite chores. Now calculate the shortest time it will take to complete all N chores. Of course, chores that do not depend on each other can be performed simultaneously.
Input
Line 1: One integer, N
Lines 2..N+1: N lines, each with several space-separated integers. Line 2 contains chore 1; line 3 contains chore 2, and so on. Each line contains the length of time to complete the chore, the number of the prerequisites, Pi, (0 <= Pi <= 100), and the Pi prerequisites (range 1..N, of course).
Output
A single line with an integer which is the least amount of time required to perform all the chores.
Sample Input
7
5 0
1 1 1
3 1 2
6 1 1
1 2 2 4
8 2 2 4
4 3 3 5 6
Sample Output
23
Hint
[Here is one task schedule:
Chore 1 starts at time 0, ends at time 5. Chore 2 starts at time 5, ends at time 6. Chore 3 starts at time 6, ends at time 9. Chore 4 starts at time 5, ends at time 11. Chore 5 starts at time 11, ends at time 12. Chore 6 starts at time 11, ends at time 19. Chore 7 starts at time 19, ends at time 23.
很水的一道dp,太水,我竟连RE了3次,数组竟要开到10000,
题目中哪有啊(T_T)!!
#include<cstdio>#include<iostream>using namespace std;int dp[11000];int main () { int n,m,k,t,ans=0,p; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d%d",&m,&k); int p=0; for(int j=0;j<k;j++) { scanf("%d",&t); p=max(p,dp[t]); } dp[i]=p+m; ans=max(dp[i],ans); } printf("%d",ans); return 0;}
- POJ [USACO] Chores
- poj 1949 Chores
- poj 1949 Chores
- POJ 1949 Chores
- poj 1949 Chores
- POJ Chores - from lanshui_Yang
- ACM POJ 1949 Chores
- POJ 1949 Chores
- 【poj 1949】Chores
- poj 1949 Chores
- POJ 1949 Chores 笔记
- usaco 2002 月赛 Chores 题解
- POJ 1949 Chores 动态规划
- POJ 1949 Chores(树状DP)
- poj 1949——Chores
- POJ 1949 Chores(DP)
- [poj 1949]Chores 题解 [dp]
- Chores
- c/c++第三天
- POJ-多边形的应用(皮克公式)
- 红黑树
- oracle扩展表空间
- URL编码 百分号编码和解码 URLEncoder和URLDecoder的大致实现原理
- POJ [USACO] Chores
- Android 一个改善的okHttp封装库
- android studio 调试技巧(简直太好用)
- 经典DP 搬寝室
- 数据库设计两个使用技巧
- 10037---深入浅出JMS(三)--ActiveMQ简单的HelloWorld实例
- MA5889,奇岩MA5889,USB智能识别充电(双通道)解决方案
- java 和c#泛型
- Request的getParameter和getAttribute方法的区别