BZOJ 1106: [POI2007]立方体大作战tet 树状数组_贪心
Code:
#include<bits/stdc++.h>
#define setIO(s) freopen(s".in","r",stdin)
#define maxn 10000000
using namespace std;
int C[maxn],pos[maxn];
int n,m,ans=0;
int lowbit(int t) { return t & (-t); }
void update(int x,int d)
{
while(x <= m) C[x] += d, x += lowbit(x);
}
int query(int x)
{
int t=0;
while(x>0) t+=C[x], x -= lowbit(x);
return t;
}
int main()
{
// setIO("input");
scanf("%d",&n), m=(n<<1);
for(int i=1;i<=m;++i)
{
int a;
scanf("%d",&a);
if(!pos[a])
{
pos[a] = i;
update(i, 1);
}
else
{
ans += query(i) - query(pos[a]);
update(pos[a], -1);
}
}
printf("%d\n",ans);
return 0;
}