摘要:
These days, Sempr is crazed on one problem named Crazy Thair. Given N (1 ≤ N ≤ 50000) numbers, which are no more than 109, Crazy Thair is a group of 5 numbers {i, j, k, l, m} satisfying:
1. 1 ≤ i < j < k < l < m ≤ N
2. Ai < Aj < A 阅读全文
![](http://images.cnblogs.com/cnblogs_com/ZegWe/894885/t_pixiv%2027396582%20%E5%90%8D%E8%AA%89%E3%81%82%E3%82%8B%E3%83%97%E3%83%AA%E3%82%AD%E3%83%A5%E3%82%A2%E3%81%AE%E6%B4%BB%E5%8B%95_%E6%A1%9C%E4%BA%95%E6%96%97%E9%A6%AC.png)