哈理工团队赛 D pairs
D Pairs Description Given N integers, count the number of pairs of integers whose sum is less than K. And we have M queries. Input The first behavior is an integer T (1 < = T < = 10), on behalf of
原创
2016-12-05 14:47:55 ·
483 阅读 ·
0 评论