跨章节建模

#include <bits/stdc++.h>
using namespace std;

int main() {
vector<vector<pair<int,int>>>g{{{1,2},{2,1}},{{3,3}},{{3,7}}, {}};vector<int>in{0,1,1,2},longest(4,-1000000),shortest(4,1000000);longest[0]=shortest[0]=0;queue<int>q;q.push(0);
while(!q.empty()){int u=q.front();q.pop();for(auto [v,w]:g[u]){longest[v]=max(longest[v],longest[u]+w);shortest[v]=min(shortest[v],shortest[u]+w);if(--in[v]==0)q.push(v);}}
cout<<longest[3]<<" "<<shortest[3];
}

#include <bits/stdc++.h>
using namespace std;

int main() {
vector<vector<pair<int,int>>>g{{{1,2},{2,1}},{{3,3}},{{3,7}}, {}};vector<int>in{0,1,1,2},longest(4,-1000000),shortest(4,1000000);longest[0]=shortest[0]=0;queue<int>q;q.push(0);
while(!q.empty()){int u=q.front();q.pop();for(auto [v,w]:g[u]){longest[v]=max(longest[v],longest[u]+w);shortest[v]=min(shortest[v],shortest[u]+w);if(--in[v]==0)q.push(v);}}
cout<<longest[3]<<" "<<shortest[3];
}