警钟长鸣
查看原帖
警钟长鸣
784650
__My0217__楼主2024/3/28 22:44

注意位运算优先级

else if(i != in^1) low[u] = min(low[u], dfn[v]); 0pts

else if(i != (in^1)) low[u] = min(low[u], dfn[v]); 100pts

2024/3/28 22:44
加载中...