09 2023 档案
点双/边双 连通分量
摘要：点双 找到割点后 一直退栈 http://ybt.ssoier.cn:8088/problem_show.php?pid=1521 include <iostream> #include <algorithm> #include <cmath> #include <vector> #include< 阅读全文
posted @ 2023-09-25 22:13 towboat 阅读(11) 评论(0) 推荐(0)
map的遍历
摘要：for( x: iter ) x为一个pair map<int,int> mp ; signed main(){ mp[3] =4 ; mp[33] =1; for(auto xx:mp) cout << xx.first<<' '<<xx.second <<endl; } 阅读全文
posted @ 2023-09-24 21:15 towboat 阅读(7) 评论(0) 推荐(0)