40pts求条
查看原帖
40pts求条
1260767
mixue_bc楼主2025/1/15 19:33
#include<bits/stdc++.h>
//#pragma GCC optimize(2)
#define int long long
#define INF LLONG_MAX
#define _INF LLONG_MIN
#define ios ios::sync_with_stdio(0),cout.tie(0),cin.tie(0);
#define _for(a,b,c) for(int i=a;i<=b;i+=c)
#define _fof(a,b,c) for(int i=a;i<b;i+=c)
#define _ror(a,b,c) for(int i=a+1;i<=b;i+=c)
#define _rof(a,b,c) for(int i=a+1;i<b;i+=c)
using namespace std;
const int N=25;
int n,dp[N],g[N][N],a[N],pre[N],idx,res;
void print(int x){
    if(!x)return;
    print(pre[x]);
    cout<<x<<' ';
}
signed main(){
    int t;
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<n;i++){
        for(int j=i+1;j<=n;j++){
            cin>>g[i][j];
        }
    }
    for(int i=1;i<=n;i++){
        dp[i]=a[i];
        for(int j=1;j<i;j++){
            if(g[i][j]&&dp[j]+a[i]>dp[i]){
                dp[i]=dp[j]+a[i];
                pre[i]=j;
            }
        }
        if(dp[i]>res)res=dp[i],idx=i;
    }
    print(idx);
    cout<<'\n'<<res;
    return 0;
}
2025/1/15 19:33
加载中...