p7399 栈
输入x,一直找到小于等于x的数,如果等于x说明可以合并,若不等则压进栈里ans++;
P7399 [COCI2020-2021#5] Po - Perta 的博客 - 洛谷博客 (luogu.com.cn)
#include<bits/stdc++.h>
#define ll long long
#define lowbit(a) ((a)&(-a))
//typedef __int128 LL;
using namespace std;
const int inf=0x3f3f3f3f;
const int mod=1000000007;
const double eps=1e-11;
ll read() {//快读
ll x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
void write(int x) {//快写
if(x<0) putchar('-'),x=-x;
if(x>9) write(x/10);
putchar(x%10+'0');
}
ll qpow(ll a,ll b){//快速幂
ll res=1;
while(b){
if(b&1) res=res*a%mod;
a=a*a%mod;
b>>=1;
}
return res;
}
ll getinv(ll a,ll mod){return qpow(a,mod-2);}//费马小定理求逆元
bool cmp1(int a,int b){return a>b;}
ll n,x,ans=0;
stack<ll>s;
int main(){
//freopen("in.txt","r",stdin);
n=read();
for(int i=1;i<=n;i++){
x=read();
while(!s.empty()&&s.top()>x) s.pop();
if(!s.empty()&&s.top()==x) continue;
if(x) s.push(x),ans++;
}
cout<<ans<<endl;
return 0;
}
p1168 vector
充分利用了vector的insert还有二分函数lowerbound,非常巧妙
题解 P1168 【中位数】 - deco 的博客 - 洛谷博客 (luogu.com.cn)
#include<bits/stdc++.h>
#define ll long long
#define lowbit(a) ((a)&(-a))
//typedef __int128 LL;
using namespace std;
const int inf=0x3f3f3f3f;
const int mod=1000000007;
const double eps=1e-11;
ll read() {//快读
ll x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
void write(int x) {//快写
if(x<0) putchar('-'),x=-x;
if(x>9) write(x/10);
putchar(x%10+'0');
}
ll qpow(ll a,ll b){//快速幂
ll res=1;
while(b){
if(b&1) res=res*a%mod;
a=a*a%mod;
b>>=1;
}
return res;
}
ll getinv(ll a,ll mod){return qpow(a,mod-2);}//费马小定理求逆元
bool cmp1(int a,int b){return a>b;}
int n,x;
vector<int>v;
int main(){
//freopen("in.txt","r",stdin);
n=read();
for(int i=1;i<=n;i++){
x=read();
v.insert(lower_bound(v.begin(),v.end(),x),x);
if(i&1)
printf("%d\n",v[(i-1)/2]);
}
return 0;
}
p1637 树状数组+dp
dp[i][j]表示长度位i以a[j]结尾的最长子序列的个数,用离散化和树状数组优化,然后以树状数组的方式存储dp[i-1][k](k<j)的结果,配合dp进行转移
题解 P1637 【三元上升子序列】 - 紫题 的博客 - 洛谷博客 (luogu.com.cn)
#include<bits/stdc++.h>
#define ll long long
#define lowbit(a) ((a)&(-a))
//typedef __int128 LL;
using namespace std;
const ll inf=0x3f3f3f3f3f3f3f3f;
const int mod=1000000007;
const double eps=1e-11;
ll read() {//快读
ll x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
void write(int x) {//快写
if(x<0) putchar('-'),x=-x;
if(x>9) write(x/10);
putchar(x%10+'0');
}
ll qpow(ll a,ll b){//快速幂
ll res=1;
while(b){
if(b&1) res=res*a%mod;
a=a*a%mod;
b>>=1;
}
return res;
}
ll getinv(ll a,ll mod){return qpow(a,mod-2);}//费马小定理求逆元
bool cmp1(int a,int b){return a>b;}
ll n,s[30005],a[30005],dp[5][30005],c[30005];
void add(ll x,ll y){
for(int i=x;i<=n;i+=lowbit(i))
c[i]+=y;
}
ll getsum(ll x){
ll res=0;
for(int i=x;i;i-=lowbit(i))
res+=c[i];
return res;
}
int main(){
//freopen("in.txt","r",stdin);
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i],s[i]=a[i];
sort(s+1,s+n+1);
ll m=unique(s+1,s+n+1)-s-1;
for(int i=1;i<=n;i++) dp[1][i]=1,a[i]=lower_bound(s+1,s+m+1,a[i])-s;
for(int i=2;i<=3;i++){
memset(c,0,sizeof(c));
for(int j=1;j<=n;j++){
dp[i][j]=getsum(a[j]-1);//获取dp[i-1][k](a[k]<a[j])的最长子序列的个数
add(a[j],dp[i-1][j]);//更新dp[i-1][j]
}
}
ll ans=0;
for(int i=1;i<=n;i++) ans+=dp[3][i];
cout<<ans<<endl;
return 0;
}
p2345 树状数组
先根据v排升序,然后开两个树状数组来维护,一个维护a[i].x之前已经有的牛的个数,另一个维护a[i].x之前已经有的牛距离a[i].x的距离和,然后模拟一个一个牛的放,放一个就计算一下音量累加,公式是第i头牛配合别的牛能发出的音量=(前面牛的个数*a[i].x-前面牛的距离和+后面牛的距离和-后面牛的个数*a[i].x)*a[i].v;
题解 P2345 【奶牛集会】 - 龙·海流 的博客 - 洛谷博客 (luogu.com.cn)
#include<bits/stdc++.h>
#define ll long long
#define lowbit(a) ((a)&(-a))
//typedef __int128 LL;
using namespace std;
const ll inf=0x3f3f3f3f3f3f3f3f;
const int mod=1000000007;
const double eps=1e-11;
ll read() {//快读
ll x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
void write(int x) {//快写
if(x<0) putchar('-'),x=-x;
if(x>9) write(x/10);
putchar(x%10+'0');
}
ll qpow(ll a,ll b){//快速幂
ll res=1;
while(b){
if(b&1) res=res*a%mod;
a=a*a%mod;
b>>=1;
}
return res;
}
ll getinv(ll a,ll mod){return qpow(a,mod-2);}//费马小定理求逆元
bool cmp1(int a,int b){return a>b;}
ll n,amt[20005],dis[20005],mn=20000;
struct cow{
ll xi,vi;
}a[20005];
bool cmp(cow a,cow b){
return a.vi<b.vi;
}
void add1(ll x){
for(int i=x;i<=mn;i+=lowbit(i))
amt[i]++;
}
ll getsum1(ll x){
ll res=0;
for(int i=x;i;i-=lowbit(i))
res+=amt[i];
return res;
}
void add2(ll x,ll y){
for(int i=x;i<=mn;i+=lowbit(i))
dis[i]+=y;
}
ll getsum2(ll x){
ll res=0;
for(int i=x;i;i-=lowbit(i))
res+=dis[i];
return res;
}
int main(){
//freopen("in.txt","r",stdin);
n=read();
for(int i=1;i<=n;i++) a[i].vi=read(),a[i].xi=read();
sort(a+1,a+n+1,cmp);
ll ans=0;
for(int i=1;i<=n;i++){
ll j=a[i].xi;
ans+=a[i].vi*(getsum1(j-1)*j-getsum2(j-1)+getsum2(mn)-getsum2(j)-(getsum1(mn)-getsum1(j))*j);
add1(j);
add2(j,j);
}
printf("%lld\n",ans);
return 0;
}
p3740 浮水法求区间覆盖
求区间覆盖的新方法(好像别的我也不会。。。)这篇题解讲的挺好的
题解 P3740 【[HAOI2014]贴海报】 - 某谷最蒻QwQ - 洛谷博客 (luogu.com.cn)
#include<bits/stdc++.h>
#define ll long long
#define lowbit(a) ((a)&(-a))
//typedef __int128 LL;
using namespace std;
const ll inf=0x3f3f3f3f3f3f3f3f;
const int mod=1000000007;
const double eps=1e-11;
ll read() {//快读
ll x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
void write(int x) {//快写
if(x<0) putchar('-'),x=-x;
if(x>9) write(x/10);
putchar(x%10+'0');
}
ll qpow(ll a,ll b){//快速幂
ll res=1;
while(b){
if(b&1) res=res*a%mod;
a=a*a%mod;
b>>=1;
}
return res;
}
ll getinv(ll a,ll mod){return qpow(a,mod-2);}//费马小定理求逆元
bool cmp1(int a,int b){return a>b;}
ll n,m,A[1005],B[1005],ans=0,vis[1005];
void sol(ll a,ll b,ll now,ll num){
if(vis[num]) return;
while(now<=m&&(b<=A[now]||a>=B[now])) now++;
if(now>m){ans++;vis[num]=1;return;}
if(a<A[now]&&A[now]<b) sol(a,A[now],now+1,num);//左半区间继续去验证
if(b>B[now]&&B[now]>a) sol(B[now],b,now+1,num);//右半区间继续去验证
}
int main(){
//freopen("in.txt","r",stdin);
n=read();m=read();
for(int i=1;i<=m;i++){A[i]=read();B[i]=read();B[i]++;}
for(int i=m-1;i>=1;i--) sol(A[i],B[i],i+1,i);
cout<<ans+1<<endl;
return 0;
}
p5367 康托展开新模板 树状数组优化
题解 P5367 【【模板】康托展开】 - yangrunze 的秘密小屋 - 洛谷博客 (luogu.com.cn)
#include<bits/stdc++.h>
#define ll long long
#define lowbit(a) ((a)&(-a))
using namespace std;
const int inf=0x3f3f3f3f;
const int mod=998244353;
ll fac[1000006]={1};
ll n,t[1000006],a[1000006];
void add(ll x,ll y){
for(int i=x;i<=n;i+=lowbit(i))
t[i]+=y;
}
ll getsum(ll x){
ll res=0;
for(int i=x;i;i-=lowbit(i))
res+=t[i];
return res;
}
int main(){
// freopen("in.txt","r",stdin);
cin>>n;
for(int i=1;i<=n;i++){
fac[i]=(fac[i-1]*i)%mod;
add(i,1);
}
ll ans=0;
for(int i=1;i<=n;i++){
cin>>a[i];
ans=(ans+(getsum(a[i]-1)*fac[n-i])%mod)%mod;
add(a[i],-1);
}
printf("%lld\n",ans+1);
return 0;
}
p4868 树状数组
推公式。。。
题解 P4868 【Preprefix sum】 - wljss 的博客 - 洛谷博客 (luogu.com.cn)
#include<bits/stdc++.h>
#define ll long long
#define lowbit(a) ((a)&(-a))
//typedef __int128 LL;
using namespace std;
const ll inf=0x3f3f3f3f3f3f3f3f;
const int mod=1000000007;
const double eps=1e-11;
ll read() {//快读
ll x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
void write(int x) {//快写
if(x<0) putchar('-'),x=-x;
if(x>9) write(x/10);
putchar(x%10+'0');
}
ll qpow(ll a,ll b){//快速幂
ll res=1;
while(b){
if(b&1) res=res*a%mod;
a=a*a%mod;
b>>=1;
}
return res;
}
ll getinv(ll a,ll mod){return qpow(a,mod-2);}//费马小定理求逆元
bool cmp1(int a,int b){return a>b;}
ll n,m,t1[100005],t2[100005],a[100005],x,y;
string s;
void add1(ll x,ll y){
for(int i=x;i<=n;i+=lowbit(i))
t1[i]+=y;
}
ll getsum1(ll x){
ll res=0;
for(int i=x;i;i-=lowbit(i))
res+=t1[i];
return res;
}
void add2(ll x,ll y){
for(int i=x;i<=n;i+=lowbit(i))
t2[i]+=y;
}
ll getsum2(ll x){
ll res=0;
for(int i=x;i;i-=lowbit(i))
res+=t2[i];
return res;
}
int main(){
//freopen("in.txt","r",stdin);
n=read();m=read();
for(int i=1;i<=n;i++){
a[i]=read();
add1(i,a[i]);
add2(i,a[i]*i);
}
while(m--){
cin>>s;
if(s[0]=='Q'){
x=read();
printf("%lld\n",(x+1)*getsum1(x)-getsum2(x));
}
else{
x=read();y=read();
add1(x,y-a[x]);add2(x,(y-a[x])*x);
a[x]=y;
}
}
return 0;
}