hdu 4109 Instrction Arrangement(关键路径)

hdu 4109 Instrction Arrangement(关键路径)

题目：​​Arrangement​​

​​Submit​​​ ​​Status​​

Description

Ali has taken the Computer Organization and Architecture course this term. He learned that there may be dependence between instructions, like WAR (write after read), WAW, RAW.  If the distance between two instructions is less than the Safe Distance, it will result in hazard, which may cause wrong result. So we need to design special circuit to eliminate hazard. However the most simple way to solve this problem is to add bubbles (useless operation), which means wasting time to ensure that the distance between two instructions is not smaller than the Safe Distance.  The definition of the distance between two instructions is the difference between their beginning times.  Now we have many instructions, and we know the dependent relations and Safe Distances between instructions. We also have a very strong CPU with infinite number of cores, so you can run as many instructions as you want simultaneity, and the CPU is so fast that it just cost 1ns to finish any instruction.  Your job is to rearrange the instructions so that the CPU can finish all the instructions using minimum time.

Input

The input consists several testcases.  The first line has two integers N, M (N <= 1000, M <= 10000), means that there are N instructions and M dependent relations.  The following M lines, each contains three integers X, Y , Z, means the Safe Distance between X and Y is Z, and Y should run after X. The instructions are numbered from 0 to N - 1.

Output

Print one integer, the minimum time the CPU needs to run.

Sample Input

5 2 1 2 1 3 4 1

Sample Output

2

Hint

In the 1st ns, instruction 0, 1 and 3 are executed; In the 2nd ns, instruction 2 and 4 are executed. So the answer should be 2.

关键路径：关键路径通常(但并非总是)是决定项目工期的进度活动序列。它是项目中最长的路径，即使很小浮动也可能直接影响整个项目的最早完成时间。本题就是应用关键路径的算法求出最短时间(最长的一条子路径)。

百度上的例子：

这时从开始顶点到达完成顶点的所有路径都是关键路径。一个AOE网的关键路径可以不止一条，如图AOE网中有二条关键路径，（v1,v2,v5,v7,v9 ) 和 (v1,v2,v5,v8,v9 ）它们的路径长度都是24。如图所示：

本题代码：

#include #include #include using namespace std;const int N=1005;int indeg[N],finish[N],n,m;struct node{ int v,cost; struct node *next; node(){ v=cost=0; next=NULL; }}vnode[N];void init(){ memset(indeg,0,sizeof(indeg)); memset(vnode,0,sizeof(vnode)); for(int i=0;iv=b; s->cost=c; s->next=vnode[a].next; vnode[a].next=s; }}void topo(){ node *p; int v; for(int i=0;iv]cost) finish[p->v]=finish[v]+p->cost; indeg[p->v]--; p=p->next; } }}int main(){ //freopen("cin.txt","r",stdin); int ans; while(cin>>n>>m){ init(); ans=0; create(); topo(); for(int i=0;ians)ans=finish[i]; printf("%d\n",ans); } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。