AC解 - 用动态规划解决一道排列组合计数问题(序关系计算)
原题如下:http://acm.nankai.edu.cn/problem.php?problem=1134
[同时请参考网友pandm发的帖子:http://topic.csdn.net/u/20110525/01/adf4d0b0-2b8e-4c0a-b8da-07b27f1711cc.html?seed=589816236&r=73524109#r_73524109]
There are 13 possible orderings for three numbers, if we sort them with the relation '<' and '=':
A = B = C , A = B < C , A < B = C ,A < B < C
A < C < B , A = C < B , B < A = C ,B < A < C
B &l......
阅读全文