hdu2614(dfs)
来源:互联网 发布:淘宝运营方案怎么写 编辑:程序博客网 时间:2024/06/05 15:08
Beat
Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1869 Accepted Submission(s): 1116
Problem Description
Zty is a man that always full of enthusiasm. He wants to solve every kind of difficulty ACM problem in the world. And he has a habit that he does not like to solve
a problem that is easy than problem he had solved. Now yifenfei give him n difficulty problems, and tell him their relative time to solve it after solving the other one.
You should help zty to find a order of solving problems to solve more difficulty problem.
You may sure zty first solve the problem 0 by costing 0 minute. Zty always choose cost more or equal time’s problem to solve.
a problem that is easy than problem he had solved. Now yifenfei give him n difficulty problems, and tell him their relative time to solve it after solving the other one.
You should help zty to find a order of solving problems to solve more difficulty problem.
You may sure zty first solve the problem 0 by costing 0 minute. Zty always choose cost more or equal time’s problem to solve.
Input
The input contains multiple test cases.
Each test case include, first one integer n ( 2< n < 15).express the number of problem.
Than n lines, each line include n integer Tij ( 0<=Tij<10), the i’s row and j’s col integer Tij express after solving the problem i, will cost Tij minute to solve the problem j.
Each test case include, first one integer n ( 2< n < 15).express the number of problem.
Than n lines, each line include n integer Tij ( 0<=Tij<10), the i’s row and j’s col integer Tij express after solving the problem i, will cost Tij minute to solve the problem j.
Output
For each test case output the maximum number of problem zty can solved.
Sample Input
30 0 01 0 11 0 030 2 21 0 11 1 050 1 2 3 10 0 2 3 10 0 0 3 10 0 0 0 20 0 0 0 0
Sample Output
324HintHint: sample one, as we know zty always solve problem 0 by costing 0 minute. So after solving problem 0, he can choose problem 1 and problem 2, because T01 >=0 and T02>=0. But if zty chooses to solve problem 1, he can not solve problem 2, because T12 < T01. So zty can choose solve the problem 2 second, than solve the problem 1.
Author
yifenfei
Source
奋斗的年代
#include<cstdio>#include<iostream>#include<string.h>#include<algorithm>using namespace std;int map[20][20];int vis[20];int ans;int n;void dfs(int cnt,int pre,int num){ ans=max(ans,cnt);for(int i=1;i<n;i++){if(vis[i]!=1&&map[pre][i]>=num){vis[i]=1;dfs(cnt+1,i,map[pre][i]);vis[i]=0;}}}int main(){while(scanf("%d",&n)!=EOF){for(int i=0;i<n;i++){for(int j=0;j<n;j++){scanf("%d",&map[i][j]);}}memset(vis,0,sizeof(vis));vis[0]=1;ans=0;dfs(1,0,0);printf("%d\n",ans);}return 0;}
阅读全文
0 0
- hdu2614 DFS
- HDU2614 DFS
- hdu2614(dfs)
- hdu2614:Beat(dfs)
- hdu2614 Beat 简单dfs
- hdu2614 Beat--DFS
- 【hdu2614】Beat——dfs
- hdu2614 Beat BFS or DFS
- hdu2614 Beat(简单dfs)
- hdu2614
- HDU2614
- HDU2614
- hdu2614
- ACM-DFS之Beat——hdu2614
- HDU2614 Beat
- HDU2614 Beat
- hdu2614之简单搜索
- DFS
- 打印多层金字塔 (15 分)
- nrm -- npm镜像源管理工具
- 关于第一篇博客
- 作业5
- 猜数游戏-LintCode
- hdu2614(dfs)
- mysql 共享锁与排他锁
- IO流(二)
- 交通工具
- JVM
- 例题8-3 和为0的4个值(4 Values Whose Sum is Zero, ACM/ICPC SWERC 2005, UVa 1152)
- 图结构练习——最短路径(dijkstra算法)
- 括号匹配详解
- 三目运算符?: