Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
74729 | 蔡哲恒 | 金矿 | C++ | Time Limit Exceeded | 0 | 1000 MS | 248 KB | 507 | 2023-04-14 14:01:55 |
#include<bits/stdc++.h> using namespace std; int n,a[1002],x,i,j,num[1002],maxn=0; bool t[1002][1002]={0}; int main() { scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&a[i]); } for(i=1;i<=n;i++) { while(scanf("%d",&x)!='\n') { scanf("%d",&x); t[i][x]=1; } } for(i=1;i<=n;i++) { num[i]=1; for(j=1;j<n;j++) { if((t[i][j]==1)&&(i!=j)) { num[i]=max(num[i],num[i]+a[i]); } } maxn=max(maxn,num[i]); } printf("%d",maxn); return 0; }