思路:记录当前用的最大时间即刚解决的问题花费的时间,下一个应该做的题的时间必须大于等于刚才的。
AC代码
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <utility>
#include <string>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000")
#define eps 1e-10
#define inf 0x3f3f3f3f
#define PI pair<int, int>
typedef long long LL;
const int maxn = 15 + 5;
int mp[maxn][maxn], vis[maxn];
int n, ans;
void dfs(int row, int cnt, int pre) {
ans = max(ans, cnt);
for(int i = 0; i < n; ++i) {
if(!vis[i] && mp[row][i] >= pre) {
vis[i] = 1;
dfs(i, cnt+1, mp[row][i]);
vis[i] = 0;
}
}
}
int main() {
while(scanf("%d", &n) == 1) {
memset(vis, 0, sizeof(vis));
ans = 1;
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
scanf("%d", &mp[i][j]);
vis[0] = 1;
dfs(0, 1, 0);
printf("%d\n", ans);
}
return 0;
}
如有不当之处欢迎指出!