提交时间:2025-05-05 19:43:18
运行 ID: 193032
#include<bits/stdc++.h> using namespace std; int n; int value[1005]; int dp[1005]; int main(){ scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",&value[i]); dp[i]=value[i]; } vector<vector<int>> v(n+1); for(int i=1;i<=n;i++){ int num; cin>>num; string line; getline(cin,line); istringstream iss(line); int temp; while(iss>>temp) v[temp].push_back(num); } for(int i=1;i<=n;i++){ for(auto j:v[i]) dp[i]=max(dp[i],dp[j]+value[i]); } int max_value=*max_element(dp+1,dp+n+1); printf("%d",max_value); return 0; }