B.GardenerandtheArray思路：只要找到一个c他的每一位均在除了它的集合中出现过即可这题T了2发，用来multiset，注意multiset大的时间复杂度是O(K+logn)k是相同元素的个数，能用map尽量用map#include<bits/stdc++.h>usingnamespacestd;constintN=1e5+10;voids

B.GardenerandtheArrayThegardenerKazimirKazimirovichhasanarrayof$n$integers$c_1,c_2,\dots,c_n$.Hewantstocheckiftherearetwodifferents

题目链接题目描述：ThegardenerKazimirKazimirovichhasanarrayof\(n\)integers\(c_1,c_2,…,c_n\).Hewantstocheckiftherearetwodifferentsubsequence