Codeforces Contest 1101 problem G (Zero XOR Subset)-less —— 线性基
You are given an array a1,a2,…,an of integer numbers.Your task is to divide the array into the maximum number of segments in such a way that:each element is contained in exactly one segment;each se...
原创
2019-03-24 19:59:40 ·
227 阅读 ·
0 评论