标签：des blog http io ar os sp for strong
Description
Input
Output
Sample Input
Sample Output
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<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<cstdlib>
using namespace std;
int a[20][20],n,ans,vis[20];
void dfs(int now,int num,int dif)//当前做now题,做题数，上次数量
{
if(num>ans)
ans=num;
for(int i=1;i<n;i++)
{
if(vis[i]||a[now][i]<dif)
continue;
vis[i]=1;//选i题
dfs(i,num+1,a[now][i]);
vis[i]=0;//不选i题
}
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
ans=0;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
scanf("%d",&a[i][j]);
vis[0]=1;
dfs(0,1,0);
printf("%d\n",ans);
}
return 0;
}
标签：des blog http io ar os sp for strong
原文地址：http://www.cnblogs.com/a972290869/p/4113214.html
