摘要：1 #include 2 using namespace std; 3 const int M = 1e5 + 10 ; 4 int n , m ; 5 pair a[M] ; 6 int rk[M] ; 7 struct node { 8 int l , r , sum ; 9 } n... 阅读全文

摘要：Who Gets the Most Candies?Time Limit:5000MSMemory Limit:131072KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionNchildren are sitting in a circle ... 阅读全文

摘要：Buy TicketsTime Limit:4000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionRailway tickets were difficult to buy around the L... 阅读全文

摘要：BillboardTime Limit:8000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionAt the entrance to the university, there is a huge r... 阅读全文

摘要：敌兵布阵Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直... 阅读全文