摘要: pojBuy Tickets(线段树) 1 #include<iostream> 2 #include<algorithm> 3 #include<cstring> 4 using namespace std; 5 const int N = 200000 + 10; 6 7 int a[N], Tree[N << 2], ans[N], 阅读全文
posted @ 2022-03-20 16:12 Keyzee 阅读(22) 评论(0) 推荐(0)