线性基
_leon1999
qaq
展开
-
ACM-ICPC 2017 Asia Xi'an XOR (线段树合并线性基)
Consider an arrayAAwith n elements . Each of its element isA[i]A[i](1 \le i \le n)(1≤i≤n). Then gives two integersQQ,KK, andQQqueries follow . Each query , give youLL,RR, you can getZZby ...原创 2019-08-06 15:45:12 · 182 阅读 · 0 评论 -
2019 Multi-University Training Contest 1 Operation
Operation Time Limit: 8000/4000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 2961Accepted Submission(s): 909 Problem Description There is an integer se...原创 2019-08-07 09:01:08 · 126 阅读 · 0 评论