摘要：
问题描述 给定一颗 n 个点的树，树边带权，试求一个排列 P ，使下式的值最大 $$ \sum_{i=1}^{n 1}maxflow(P_i,P_{i+1}) $$ 其中 maxflow ( s, t ) 表示从点 s 到点 t 之间的最大流，即从 s 到 t 的路径上最小的边权。 输入格式 第一行 阅读全文
摘要：
问题描述 A new set of desks just arrived, and it's about time! Things were getting quite cramped in the office. You've been put in charge of creating a ne 阅读全文
摘要：
问题描述 As more and more transactions between companies and people are being carried out electronically over the Internet, secure communications have bec 阅读全文