摘要:
"POJ" 题意:给定一棵$n(n=2$,表示切掉这条树边,这条树边仍在环上,第二次怎么切都无法切成两个联通块,故不对不产生贡献. cpp include include include include include include include include define ll long l 阅读全文
摘要:
"POJ" "洛咕" 题意:给出一张$m(m include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1 阅读全文
摘要:
"洛咕" 题意:农民约翰的农场有一套老旧的管网,管网由M条管道(1 include include include include include include include define ll long long using namespace std; inline int read(){ 阅读全文
摘要:
"POJ" 题意:给定n个点m条边的无向图,求最小环并输出方案.最小环:至少包含3个节点,环上的节点不重复且长度之和最小.$n include include include include include include include define ll long long using name 阅读全文