1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
using ll=long long;
int tt,n,dp[(int)1e5+9],a[(int)1e5+9],x[(int)1e5+9];
void solve(){
cin>>n;
for(int i=1;i<=n;++i){
cin>>a[i];
x[i]=a[i]^x[i-1];
}
map<int,int> ma;
ma[0]=0;
for(int i=1;i<=n;++i){
if(a[i])dp[i]=dp[i-1]+1;
else dp[i]=dp[i-1];
if(ma.count(x[i])){
dp[i]=min(dp[i],ma[x[i]]+i-1);
}
ma[x[i]]=min(ma[x[i]],dp[i]-i);
}
cout<<dp[n]<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>tt;
f(sb,1,tt)solve();
return 0;
}
|