摘要:
Exposition DescriptionThere are several days left before the fiftieth birthday of a famous Berland’s writer Berlbury. In this connection the local lib 阅读全文
摘要:
T1 Description求由 1 到 n 一共 n 个数字组成的所有排列中,逆序对个数为 k 的有多少个 Hint乍一看是数学题我们考虑递推 用f[i][j]表示1~i的所有排列中逆序对为k的有多少个我们注意到把i加进去由于1~i-1都比i小,所以i可以产生0~i个逆序对得到公式:$$f[i][ 阅读全文
摘要:
The least round way DescriptionThere is a square matrix n × n, consisting of non-negative integer numbers. You should find such a way on it that start 阅读全文