标签：
|
ID
|
Origin
|
Title
| ||
|---|---|---|---|---|
| 二分+dp | 22 / 89 | Problem A | UVALive 5983 | MAGRID |
| 枚举 | 19 / 44 | Problem B | UVALive 5984 | Save the Students! |
| ? | 1 / 1 | Problem C | UVALive 5985 | Robbing Gringotts |
| ？ | 38 / 117 | Problem D | UVALive 5986 | Wizarding Duel |
| 预处理前2000个数 | 65 / 127 | Problem E | UVALive 5987 | Distinct Primes |
| 1 / 1 | Problem F | UVALive 5988 | Magical Bridges | |
| 水 | 74 / 78 | Problem G | UVALive 5989 | Here Be Dragons! |
| 7 / 18 | Problem H | UVALive 5990 | Array Diversity | |
| 2 / 3 | Problem I | UVALive 5991 | Generations | |
|
bfs |
18 / 69 | Problem J | UVALive 5992 | Goblin Wars |
H 给出n个人两两打一次比赛后每个人的胜利次数（可能不合法）记为A，记一个合法的序列B，求$\sum{abs(A_i-B_i)}$最小是多少？
标签：
原文地址：http://www.cnblogs.com/cheater/p/4743243.html
