fl_334正经的码棚

#include<iostream>#define ll long longusing namespace std;const int maxn=200010;int n,q,data;long long bit0[maxn],bit1[maxn];void add(long long bit[],int i,int x){ while (i<=n){ bit[i]

模板废话#include<iostream>#define ll long longusing namespace std;const int maxn=500010;int n,m;int bit[maxn];void add(int i,int x){ while (i<=n){ bit[i]+=x; i+=i&-i; }}ll sum

334的蠢码废话不说，贴码#include<iostream>using namespace std;long long sum[500100*4+1];void pushup(int rt){ sum[rt]=sum[rt<<1]+sum[rt<<1|1];}void build(int rt,int l,int r){ if (l==r){ cin>>sum[

在n*n的格子上有m个地毯。给出这些地毯的信息，问每个点被多少个地毯覆盖。 输入样例#1： 5 3 2 2 3 3 3 3 5 5 1 2 1 4 输出样例#1： 0 1 1 1 0 0 1 1 0 0 0 1 2 1 1 0 0 1 1 1 0 0 1 1 1#include<iostream>using namespace std;const int maxn=1010

#include&lt;iostream&gt;#include&lt;algorithm&gt;#define ll long longusing namespace std;const int maxn=100010;struct node{ int w; int p;}a[maxn];int n;int bit[maxn];int cmp(node a,...