hdu 2614 Beat
2018-01-22 13:09
232 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2614
DFS入门题#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
const int maxn = 20;
int n, Ans;
int Map[maxn][maxn];
int ans[maxn];
bool vis[maxn];
void DFS(int x, int Size, int cost)
{
Ans = max(Size, Ans);
for(int i = 0; i < n; i++)
{
if(vis[i]) continue;
if(Map[x][i] >= cost)
{
vis[i] = 1;
DFS(i, Size + 1, Map[x][i]);
vis[i] = 0;
}
}
}
int main()
{
while(cin >> n)
{
Ans = 0;
memset(vis, 0, sizeof(vis));
memset(ans, 0, sizeof(ans));
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
scanf("%d", &Map[i][j]);
}
}
vis[0] = 1;
DFS(0, 1, 0);
cout << Ans << endl;
}
return 0;
}
DFS入门题#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
const int maxn = 20;
int n, Ans;
int Map[maxn][maxn];
int ans[maxn];
bool vis[maxn];
void DFS(int x, int Size, int cost)
{
Ans = max(Size, Ans);
for(int i = 0; i < n; i++)
{
if(vis[i]) continue;
if(Map[x][i] >= cost)
{
vis[i] = 1;
DFS(i, Size + 1, Map[x][i]);
vis[i] = 0;
}
}
}
int main()
{
while(cin >> n)
{
Ans = 0;
memset(vis, 0, sizeof(vis));
memset(ans, 0, sizeof(ans));
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
scanf("%d", &Map[i][j]);
}
}
vis[0] = 1;
DFS(0, 1, 0);
cout << Ans << endl;
}
return 0;
}
相关文章推荐
- hdu 2614 Beat
- hdu 2614 beat
- 【DFS】 HDU 2614 Beat 水
- [HDU] 2614 beat
- HDU 2614 Beat
- hdu 2614 Beat(DFS)
- HDU 2614 Beat(dfs+回溯)
- HDU 2614 Beat(dfs)
- HDU 2614 Beat(DFS)
- HDU:2614 beat
- HDU 2614 Beat(dfs)
- 杭电 hdu 2614 Beat
- HDU 2614 Beat
- HDU 2614 Beat【深搜】
- hdu(2614) Beat
- hdu 2614 Beat
- hdu 2614 Beat
- hdu 2614 Beat (dfs)
- HDU - 2614 Beat
- hdu 2614 BEAT 回溯的dfs