开O2全WA,不开O2AC求解
  • 板块P1113 杂务
  • 楼主ZhuHua14
  • 当前回复1
  • 已保存回复1
  • 发布时间2023/11/14 21:16
  • 上次更新2023/11/15 00:25:19
查看原帖
开O2全WA,不开O2AC求解
826012
ZhuHua14楼主2023/11/14 21:16
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;

int n,value[MAXN],ans[MAXN];
bool isRead[MAXN];
vector <int> v[MAXN];

int dfs(int nowp){
	if(isRead[nowp] == 1){
		return ans[nowp];
	}
	for(int i = 0; i < v[nowp].size(); i++){
		ans[nowp] = max(ans[nowp],dfs(v[nowp][i]));
	}
	ans[nowp] += value[nowp];
	isRead[nowp] = 1;
	return ans[nowp];
}
int main(){
	cin>>n;
	int nowp,nowval,nowfrom;
	for(int i = 1; i <= n; i++){
		cin>>nowp>>nowval;
		value[nowp] = nowval;
		while(1){
			cin>>nowfrom;
			if(nowfrom == 0){
				break;
			}
			v[nowp].push_back(nowfrom);
		}
	}
	int nowans;
	for(int i = 1; i <= n; i++){
		nowans = max(dfs(i),nowans);
	}
	cout<<nowans;
	return 0;
}

本地开O2结果是对的,但是上传之后全wa,不开o2AC,求解(标准c++14)

2023/11/14 21:16
加载中...