写代码时一定要想想时间复杂度
比如说我cspj t3
枚举异或等于k的区间，用了O(n2)O(n^2)O(n2)的时间复杂度
但是实际上我要找的是第一个小于i的数，
其实用set就能将时间压缩到O(nlogn)O(nlogn)O(nlogn)
t3修改代码
C24zhouyanchen LV 4
By signing up a ZXOJ universal account, you can submit code and join discussions in all online judging services provided by us.
Using your ZXOJ universal account
C24zhouyanchen LV 4 @ 2025-11-19 18:55:30
