【hdu2614】Beat——dfs

题目：

Beat

Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1203    Accepted Submission(s): 716

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.

 

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.

 

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

324
Hint
Hint: 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

说明：给一个点集，给出完全图的权值，从0点出发求权值依次增大的最多的边的排列，一个点一次且边有向

题解：把当前边的权值当作参数传给dfs，边搜边更新。

代码：

#include<cstdio>#include<cstring>#include <algorithm>using namespace std;int flag[16];int map[16][16], sum, n;void dfs(int th, int num, int time){for (int i = 0; i<n; i++){if (flag[i] || map[th][i]<time) continue;flag[i] = 1;dfs(i, num + 1, map[th][i]);flag[i] = 0;}sum = max(sum, num);}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(flag, 0, sizeof(flag));sum = 0;flag[0] = 1;dfs(0, 1, 0);printf("%d\n", sum);}return 0;}