复杂度太高了，建议学了线段树再来做这题
by gghack_Nythix @ 2023-04-24 21:43:52
@[pppppLF](/user/990781) 我随便构造一个数据1e5次的查询每次区间长度1e5就TLE了
by gghack_Nythix @ 2023-04-24 21:46:07
观点同楼上大佬，本题大概是O(n^2)级别，肯定会超时
by XH_yyds @ 2023-04-24 21:46:12
省选/NOI- 的题，sort能过还叫
省选/NOI-
by kkk_fans @ 2023-04-24 21:56:50
先不说复杂度，op=0明明是升序，你写的为什么是降序？
by hyf9134 @ 2023-05-28 10:51:26