原题: 传送门
Code:
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <sstream>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int maxn = 107;
typedef pair<int, int> P;
int a[maxn];
int mp[maxn][maxn];
int last[maxn];//last[i]表示i点上一个点的编号
int dp[maxn];//dp[i]表示终点为i最多能挖到的地雷数目
int n;
void print(int x) {
if (last[x] == 0) {
printf("%d", x);
return;
}
print(last[x]);
printf(" %d", x);
}
int main()
{
int x;
scanf("%d", &n);
for (int i=1;i<=n;i++) {
scanf("%d", &a[i]);
}
for (int i=1;i<=n;i++)
for (int j=i+1;j<=n;j++) {
scanf("%d", &x);
if (x) mp[i][j] = 1;
}
int ed = 0, ans = 0;
for (int i=1;i<=n;i++) {
for (int j=1;j<=n;j++) {
if (mp[j][i] && dp[j] > dp[i]) {
dp[i] = dp[j];
last[i] = j;
}
}
dp[i] += a[i];
if (dp[i] > ans) {
ans = dp[i];
ed = i;
}
}
print(ed);
printf("\n%d\n", ans);
return 0;
}