Dylans loves sequence HDU - 5273

$朴素莫队加树状数组$
$复杂度为n根号nlogn显然对于1e5的数据量超时了$
$以后有空再学二次离线莫队$

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
const int N = 1e5 + 10;
int a[N], c[N], ans[N];
int n, m;
int siz;
struct node{
int l, r, k;
}q[N];
vector<int> vec;
inline int read() {
int s = 0, w = 1;
char ch = getchar();
while (ch<'0' || ch>'9') { if (ch == '-')w = -1; ch = getchar(); }
while (ch >= '0'&&ch <= '9') s = s * 10 + ch - '0', ch = getchar();
return s * w;
}
bool cmp1(node a, node b)
{
if(a.l/siz == b.l/siz) return a.r < b.r;
return a.l/siz < b.l/siz;
}
int lowbit(int x){
return x & -x;
}
void add(int x, int v)
{
for(int i = x; i <= n; i += lowbit(i))
{
c[i] += v;
}
}
int query(int x)
{
int res = 0;
for(int i = x; i > 0; i -= lowbit(i))
{
res += c[i];
}
return res;
}
int find(int x)
{
int l = 0, r = vec.size();
while(l < r)
{
int mid = l + r >> 1;
if(vec[mid] >= x)
{
r = mid;
}
else l = mid + 1;
}
return l + 1;
}
int main(){
n = read();
m = read();
siz = (int)sqrt(n);
for(int i = 1; i <= n; i ++)
{
a[i] = read();
vec.push_back(a[i]);
}
sort(vec.begin(), vec.end());
vec.erase(unique(vec.begin(), vec.end()), vec.end());
int p = vec.size();
for(int i = 0; i < m; i ++)
{
q[i].l = read();
q[i].r = read();
q[i].k = i;
}
sort(q, q+m, cmp1);
int l = 1, r = 0;
int res = 0;
for(int i = 0; i < m; i ++)
{
while(r < q[i].r)
{
r ++;
int t = find(a[r]);
res += (query(p)-query(t));
add(t, 1);
}
while(r > q[i].r)
{
int t = find(a[r]);
if(c[t])
{
res -= (query(p)-query(t));
add(t, -1);
}
r --;
}
while(l < q[i].l)
{
int t = find(a[l]);
if(c[t])
{
res -= query(t-1);
add(t, -1);
}
l ++;
}
while(l > q[i].l)
{
l --;
int t = find(a[l]);
res += query(t-1);
add(t, 1);
}
ans[q[i].k] = res;
}
for(int i = 0; i < m; i ++)
{
printf("%dn", ans[i]);
}
return 0;
}

最后

以上就是自信水池为你收集整理的Dylans loves sequence HDU - 5273的全部内容，希望文章能够帮你解决Dylans loves sequence HDU - 5273所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。