强连通
文章平均质量分 66
SSL_MYD
这个作者很懒,什么都没留下…
展开
-
YBT3.4.4 洛谷P3275 糖果_恒星的亮度
YBT3.4.4 洛谷P3275 糖果_恒星的亮度Title思路建图:1A<=B,B<=AA->B B->A边权02A+1<=BA->B边权13B<=AB->A边权04B+1<=AB->A边权15A<=BA->B边权0Tanjan缩点拓扑DP入度0的点f=1f[v]=max(f[u]+w,f[v]);w为该边边权ans=∑i=1总点数f[i]∗s[i]\sum _{i=1}^{总原创 2021-05-05 11:50:25 · 113 阅读 · 0 评论 -
YBT高效进阶3.4.3 洛谷P2272最大半连通子图
YBT高效进阶3.4.3 洛谷P2272最大半连通子图Title思路Tanjan缩点,拓扑DP第一问f[v]=f[u]+s[v],s[v]为缩点后每个点原来点的个数第二问(f[u]+s[v]>f[v])g[v]=g[u];(f[u]+s[v]==f[v])g[v]=(g[v]+g[u])%mods;CODE#include<iostream>#include<cstdio>#include<stack>#include<queue原创 2021-05-05 11:32:54 · 75 阅读 · 0 评论 -
YBT高效进阶3.4.1 洛谷P3387有向图缩点
YBT高效进阶3.4.1 洛谷P3387有向图缩点Title思路建图Tanjan缩点拓扑DP设f[i]为以i为终点的值f[v]=max(f[u]+s[v],f[v])ans=max(f[i])CODE#include<iostream>#include<cstdio>#include<stack>#include<queue>using namespace std;const long long maxn=200010;stru原创 2021-05-05 11:23:53 · 90 阅读 · 1 评论 -
洛谷P2746 POJ1236校园网Network of Schools
POJ 1236 Network of SchoolsTime Limit: 1000MSMemory Limit: 10000KDescriptionA number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to which it distributes sof原创 2021-05-04 20:38:42 · 102 阅读 · 0 评论 -
YBT高效进阶3.4.2 洛谷P2341 POJ2186受欢迎的牛Popular Cows
洛谷P2341 POJ2186受欢迎的牛Title思路缩点,如果出度为0的点唯一,ans=该点原始点数若出度为0的点有多个,ans=0缩点用Floyd or Tanjan or Topsort or KosarajuCODE#include<iostream> #include<cstdio>#include<stack>using namespace std;int dfn[50010],low[50010],col[50010],s[50010]原创 2021-05-04 20:28:04 · 95 阅读 · 0 评论