hdu 2614 Beat （dfs）

最新推荐文章于 2020-07-26 18:46:29 发布

他说少年如歌

最新推荐文章于 2020-07-26 18:46:29 发布

阅读量322

点赞数

分类专栏：深搜 DFS

本文链接：https://blog.csdn.net/qq_27437781/article/details/70176055

版权

深搜 DFS 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

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.

Author
yifenfei

Source
奋斗的年代

思路：给你一些问题的难度，要求下次解决的问题的难度是大于等于上一次的难度的，直接深搜即可。

坑到了题目的提示，很明显是错的，当时郁闷了好久。

还有刚开始时我既然用二维数组进行标记，导致一直wa。郁闷！！！！

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string.h>
#include <queue>
#include <stdlib.h>
#define INF 0x3f3f3f3f
using namespace std;
int map[20][20];
int t, ans = 0;
int vis[20];  ///用一维数组来标记第i个问题是否解决过
void dfs(int p, int k, int sum)
{
    ans = max(ans, k);
    if(ans == t)
        return ;
    for(int i = 0; i < t; i++)
    {
        if(vis[i] == 1)
            continue;
        if(map[p][i] >= sum)
        {
            vis[i] = 1;
            dfs(i, k + 1, map[p][i]);
            vis[i] = 0;
        }
    }
}
int main()
{
    while(~scanf("%d",&t))
    {
        ans = 0;
        memset(vis, 0, sizeof(vis));
        for(int i = 0; i < t; i++)
        {
            for(int j = 0; j < t; j++)
            {
                cin >> map[i][j];
            }
        }
        vis[0] = 1;  ///一定要在刚开始就把第0个问题标记  有可能map[0][0]!=0
        dfs(0, 1, 0);
        printf("%d\n",ans);
    }
    return 0;
}