hdu 2614 BEAT 回溯的dfs

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.          

//http://blog.csdn.net/libin56842/article/details/41909429#include<iostream> #include<cstring>using namespace std;const int maxn=1001;int ans=0;int n;int mp[maxn][maxn];int vis[maxn];void dfs(int pos,int len,int tm){ans=max(len,ans);if(len==n)return;for(int i=1;i<=n;i++){if(!vis[i]&&mp[pos][i]>=tm){vis[i]=1;dfs(i,len+1,mp[pos][i]);vis[i]=0;}}}int main(){while(cin>>n){ans=0;memset(vis,0,sizeof(vis));for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)cin>>mp[i][j];vis[1]=1;dfs(1,1,0);cout<<ans<<endl;}return 0;} 

                                             
        0        0           
	
				
	
					   
hdu 2614 BEAT 回溯的dfs
	  	   
HDU 2614 Beat（dfs+回溯）
	  	   
HDU 2614 Beat (dfs)
	  	   
HDU 2614 Beat  (DFS)
	  	   
【DFS】 HDU 2614 Beat 水
	  	   
HDU 2614 Beat（dfs）
	  	   
HDU 2614 Beat （DFS）
	  	   
HDU 2614 Beat（DFS）
	  	   
HDU 2614 Beat（dfs）
	  	   
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
	  	   
HDU 2614 Beat
	     		  
	  	   
NIO简介
	  	   
codeforces 560E Gerald and Giant Chess （dp + 组合数）
	  	   
vba 执行 *.py
	  	   
树状数组
	  	   
java中Scanner类的简单用法分享
	  	   
hdu 2614 BEAT 回溯的dfs
	  	   
System Verilog视频学习笔记（6）- OOP-Encapsulation
	  	   
c++作业六
	  	   
Qt程序打包发布——插件发布
	  	   
Android 滑动
	  	   
01.struts简介及学习方法
	  	   
kali 2016  Metasploit启动
	  	   
重写gensim.word2vec的文本相似度匹配函数（wmdistance）
	  	   
Hibernate 映射关系