ACM-DFS之Beat——hdu2614
2014-04-03 11:20:16         来源：ACM-DFS之Beat——hdu2614

Beat
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
3
0 0 0
1 0 1
1 0 0
3
0 2 2
1 0 1
1 1 0
5
0 1 2 3 1
0 0 2 3 1
0 0 0 3 1
0 0 0 0 2
0 0 0 0 0

Sample Output
3
2

4

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.

```#include
#include
using namespace std;
int problem[16][16],vis[16];
int n,maxx;

void dfs(int line,int pre,int sl)
{
int i,flag=0;
for(i=0;i=pre)
{
vis[i]=1;
dfs(i,problem[line][i],sl+1);
vis[i]=0;
flag=1;
}
}
if(!flag)  maxx=sl>maxx?sl:maxx;
}

int main()
{
int i,j;
while(cin>>n)
{
memset(vis,0,sizeof(vis));
for(i=0;i>problem[i][j];

// 初始化maxx，开始dfs
vis[0]=1;
maxx=-1;
dfs(0,0,1);
cout<
```