HDU-2614

Beat

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

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有一些误导，导致看得并不顺畅。

简单来说就是第0题发费0分钟，以后的每一题时间都不得小于上一题。

即：T[i][j]>=T[j][k]。

由此，dfs可得。

AC代码：

#include<bits/stdc++.h>
using namespace std;

bool vis[20];
int n,MAX;
int mp[20][20];

void dfs(int now,int len,int cnt){
    MAX=max(len,MAX);
    if(MAX==n)
    return ;
    for(int i=1;i<n;i++){
        if(vis[i]==1)
        continue;
        if(mp[now][i]>=cnt){
            vis[i]=1;
            dfs(i,len+1,mp[now][i]);
            vis[i]=0;
        }
    }
}

int main(){
    while(cin>>n){
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                cin>>mp[i][j];
            }
        }
        MAX=0;
        memset(vis,0,sizeof(vis));
        vis[0]=1;
        for(int i=1;i<n;i++){
            vis[i]=1;
            dfs(i,2,mp[0][i]);
            vis[i]=0;
        }
        cout<<MAX<<endl;
    }
    return 0;
}