noip还有不到一星期,是时候整理一下模板了。
线段树(区间修改,区间求和,区间最值):
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
const int SZ=501000;
typedef long long ll;
int n,m,num[SZ];
struct ha
{
int l,r;
ll sum,add,min,max;
}tree[SZ<<2];
void update(int now)
{
tree[now].min = min(tree[now<<1].min,tree[now<<1|1].min);
tree[now].max = max(tree[now<<1].max,tree[now<<1|1].max);
tree[now].sum=tree[now<<1].sum+tree[now<<1|1].sum;
}
void build(int now,int l,int r)
{
tree[now].l=l;
tree[now].r=r;
if(l==r)
{
tree[now].min=tree[now].max=tree[now].sum=num[l];
return;
}
int mid=(l+r)>>1;
build(now<<1,l,mid);
build(now<<1|1,mid+1,r);
update(now);
}
void pushdown(int now)
{
if(tree[now].add)
{
tree[now<<1].sum+=tree[now].add*(tree[now<<1].r-tree[now<<1].l+1);
tree[now<<1].add+=tree[now].add;
tree[now<<1|1].sum+=tree[now].add*(tree[now<<1|1].r-tree[now<<1|1].l+1);
tree[now<<1|1].add+=tree[now].add;
tree[now<<1].min += tree[now].add;
tree[now<<1|1].min += tree[now].add;
tree[now<<1].max += tree[now].add;
tree[now<<1|1].max += tree[now].add;
tree[now].add=0;
}
}
void change(int now,int l,int r,ll value)
{
if(l<=tree[now].l&&tree[now].r<=r)
{
tree[now].sum+=(tree[now].r-tree[now].l+1)*value;
tree[now].max+=value;
tree[now].min+=value;
tree[now].add+=value;
return;
}
int mid=(tree[now].l+tree[now].r)>>1;
pushdown(now);
if(l<=mid) change(now<<1,l,r,value);
if(r>mid) change(now<<1|1,l,r,value);
update(now);
}
ll ask(int now, int l, int r)
{
if(tree[now].l >= l && r >= tree[now].r)
return tree[now].sum;
pushdown(now);
int mid = (tree[now].l + tree[now].r) >> 1;
ll ans = 0;
if(l <= mid) ans += ask(now << 1, l, r);
if(r > mid) ans += ask(now << 1 | 1, l, r);
return ans;
}
ll ask_min(int now,int l,int r)
{
if(l <= tree[now].l && tree[now].r <= r)
return tree[now].min;
pushdown(now);
int mid = tree[now].l + tree[now].r >> 1;
ll ans = 214748364111111ll;
if(l <= mid)
ans = min(ask_min(now<<1,l,r),ans);
if(r > mid)
ans = min(ask_min(now<<1|1,l,r),ans);
return ans;
}
ll ask_max(int now,int l,int r)
{
if(l <= tree[now].l && tree[now].r <= r)
return tree[now].max;
pushdown(now);
int mid = tree[now].l + tree[now].r >> 1;
ll ans = 0;
if(l <= mid)
ans = max(ask_max(now<<1,l,r),ans);
if(r > mid)
ans = max(ask_max(now<<1|1,l,r),ans);
return ans;
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
scanf("%d",&num[i]);
build(1,1,n);
cin>>m;
int a,b,cz;
ll c;
for(int i=1;i<=m;i++)
{
scanf("%d",&cz);
if(cz==1)
{
scanf("%d%d%lld",&a,&b,&c);
change(1,a,b,c);
}
else
{
scanf("%d%d",&a,&b);
printf("%lld\n",ask(1,a,b));
printf("%lld %lld\n",ask_min(1,a,b),ask_max(1,a,b));
}
}
return 0;
}
树状数组
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define lowbit(x) (x&(-x))
using namespace std;
const int MAXN=100000+10;
int tree[MAXN],c[MAXN],a[MAXN];
int n;
void add(int x,int y)
{
while(x<=n)
{
tree[x]+=y;
x+=lowbit(x);
}
}
int sum(int x)
{
int ans=0;
while(x)
{
ans+=tree[x];
x-=lowbit(x);
}
return ans;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
c[i]=a[i]-a[i-1];
add(i,c[i]);
}
int q;scanf("%d",&q);
while(q--)
{
int t,l,r,s;
scanf("%d",&t);
if(t==1)
{
scanf("%d%d%d",&l,&r,&s);
add(l,s);
add(r+1,-s);
}
if(t==2)
{
int pos;
scanf("%d",&pos);
printf("%d\n",sum(pos));
}
}
return 0;
}
最短路专栏:
spfa:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int sz = 200100;
deque<int>q;
int n,m;
int first[sz],nxt[sz],dist[sz];
struct edge
{
int f,t,d;
}es[sz];
int tot = 1;
bool use[sz];
int pre[sz];
int tmp[sz];//判负环
void build(int f,int t,int d)
{
es[++tot]=(edge){f,t,d};
nxt[tot]=first[f];
first[f]=tot;
}
int spfa(int s,int e)
{
for(int i=1;i<=n;i++)
dist[i]=2147483641;
dist[s]=0;
use[s]=1;
q.push_front(s);
while(!q.empty())
{
int f=q.front();
q.pop_front();
use[f]=0;
for(int i=first[f];i;i=nxt[i])
{
int t=es[i].t;
if(dist[t]>dist[f]+es[i].d)
{
dist[t]=dist[f]+es[i].d;
tmp[t] = tmp[f] + 1;
if(tmp[t]>n)
return -1;
pre[t]=f;
if(!use[t])
{
use[t]=1;
if(!q.empty())
{
if(dist[t]<dist[q.front()])
q.push_front(t);
else
q.push_back(t);
}
else
q.push_back(t);
}
}
}
}
return dist[e];
}
int main()
{
return 0;
}
堆优化dijkstra
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int SZ=101000;
const int inf=214748364;
struct edge
{
int f,t,d;
}es[SZ<<1];
struct ss
{
int u,dis;
bool operator < (const ss &a) const
{
return dis>a.dis;
}
};
int first[SZ<<1],nxt[SZ<<1],dis[SZ],tot=0;
bool vis[SZ];
priority_queue<ss>q;
void build(int f,int t,int d)
{
es[++tot]=(edge){f,t,d};
nxt[tot]=first[f];
first[f]=tot;
}
int dij(int s,int t)
{
dis[s]=0;
q.push((ss){s,0});
while(!q.empty())
{
ss now=q.top();
q.pop();
if(vis[now.u]) continue;
vis[now.u]=1;
for(int i=first[now.u];i;i=nxt[i])
{
int v=es[i].t;
if(dis[v]>dis[now.u]+es[i].d)
{
dis[v]=dis[now.u]+es[i].d;
q.push((ss){v,dis[v]});
}
}
}
return dis[t];
}
int main()
{
int n,m,s,t;
scanf("%d%d%d%d",&n,&m,&s,&t);
int u,v,w;
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&u,&v,&w);
build(u,v,w);
build(v,u,w);
}
for(int i=1;i<=n;i++)
dis[i]=inf;
printf("%d",dij(s,t));
return 0;
}
floyd:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int inf=214748364;
int dis[3010][3010];
int main()
{
int a,b,c,d;
scanf("%d%d%d%d",&a,&b,&c,&d);
for(int i=1;i<=a;i++)
for(int j=1;j<=a;j++)
dis[i][j]=inf;
int u,v,dd;
for(int i=1;i<=a;i++)
dis[i][i]=0;
for(int i=1;i<=b;i++)
{
scanf("%d%d%d",&u,&v,&dd);
dis[u][v]=min(dis[u][v],dd);
dis[v][u]=min(dis[v][u],dd);
}
for(int k=1;k<=a;k++)
for(int i=1;i<=a;i++)
for(int j=1;j<=a;j++)
dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
cout<<dis[c][d];
return 0;
}
最小生成树(Kruskal)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int SZ=101000;
struct edge
{
int f,t,d;
}es[SZ<<1];
bool cmp(edge a,edge b)
{
return a.d<b.d;
}
int ans,n,tot;
int fa[SZ];
int find(int x)
{
return fa[x]==x?x:fa[x]=find(fa[x]);
}
int Kruskal()
{
for(int i=1;i<=n;i++)
fa[i]=i;
sort(es+1,es+tot+1,cmp);
for(int i=1;i<=tot;i++)
{
int x=find(es[i].f),y=find(es[i].t);
if(x!=y)
{
fa[x]=y;
ans+=es[i].d;
}
}
return ans;
}
int main()
{
return 0;
}
trajan:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
using namespace std;
const int sz=201000;
struct edge
{
int f,t;
}es[sz<<1];
int tot=0;
int n,m;
int first[sz<<1],nxt[sz<<1];
void build(int f,int t)
{
es[++tot]=(edge){f,t};
nxt[tot]=first[f];
first[f]=tot;
}
int low[sz],dfn[sz],scc_num[sz],js[sz];
int cnt,cnt2;
stack<int>s;
int tarjan(int u)
{
dfn[u]=low[u]=++cnt;
s.push(u);
for(int i=first[u];i;i=nxt[i])
{
int v=es[i].t;
if(!dfn[v])
{
low[v]=tarjan(v);
low[u]=min(low[u],low[v]);
}
if(!scc_num[v])
low[u]=min(low[u],dfn[v]);
}
if(low[u]==dfn[u])
{
cnt2++;
while(1)
{
int v=s.top();
s.pop();
scc_num[v]=cnt2;
js[cnt2]++;
if(u==v) break;
}
}
return low[u];
}
int main()
{
return 0;
}
lca(倍增版):
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
int n;
const int SZ=101000;
struct edge
{
int f,t,d;
}es[SZ<<1];
int tot=0,first[SZ<<1],nxt[SZ<<1];
void build(int f,int t,int d)
{
es[++tot]=(edge){f,t,d};
nxt[tot]=first[f];
first[f]=tot;
}
int sd[SZ],t[SZ][30],dis[SZ];
void dfs(int u)
{
if(u==0) sd[u]=1;
for(int i=1;i<=20;i++)
t[u][i]=t[t[u][i-1]][i-1];
for(int i=first[u];i;i=nxt[i])
{
int v=es[i].t;
if(!sd[v])
{
dis[v]=dis[u]+es[i].d;
t[v][0]=u;
sd[v]=sd[u]+1;
dfs(v);
}
}
}
int lca(int u,int v)
{
if(sd[u]<sd[v]) swap(u,v);
int tt=sd[u]-sd[v];
for(int i=0;i<=20;i++)
if(tt&(1<<i))
u=t[u][i];
for(int i=20;i>=0;i--)
if(t[u][i]!=t[v][i])
{
u=t[u][i];
v=t[v][i];
}
if(u!=v) return t[u][0];
return u;
}
int main()
{
scanf("%d",&n);
int u,v,d,k;
for(int i=1;i<n;i++)
{
scanf("%d%d%d",&u,&v,&d);
build(u,v,d);
build(v,u,d);
}
dfs(0);
scanf("%d",&k);
while(k--)
{
scanf("%d%d",&u,&v);
int ans=lca(u,v);
printf("%d\n",dis[u]+dis[v]-2*dis[ans]);
}
return 0;
}
拓扑排序:
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
using namespace std;
queue<int>q;
const int SZ=100100;
int rd[SZ];
int ans,n,m;
struct edge
{
int f,t;
}es[SZ];
int tot,first[SZ],nxt[SZ];
void build(int f,int t)
{
es[++tot]=(edge){f,t};
nxt[tot]=first[f];
first[f]=tot;
}
int top_sort()
{
for(int i=1;i<=n;i++)
if(!rd[i])
{
printf("%d ",i);
q.push(i);
}
while(!q.empty())
{
int u=q.front();q.pop();
for(int i=first[u];i;i=nxt[i])
{
int v=es[i].t;
rd[v]--;
if(!rd[v])
{
printf("%d",&v);
q.push(v);
}
}
}
}
int main()
{
return 0;
}
数学:
gcd&&lcm:
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int gcd(int a,int b)
{
return b==0?a:gcd(b,a%b);
}
int lcm(int a,int b)
{
return a*b/gcd(a,b);
}
int main()
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d %d\n",gcd(a,b),lcm(a,b));
return 0;
}
exgcd(同余方程):
#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
ll exgcd(ll a,ll b,ll &x,ll &y)
{
if(b==0)
{
x=1;y=0;
return a;
}
ll ans=exgcd(b,a%b,x,y);
ll temp=x;
x=y;
y=temp-(a/b)*y;
return ans;
}
int main()
{
ll a,b,x,y;
scanf("%lld%lld",&a,&b);
exgcd(a,b,x,y);
while(x<=0)x+=b;
cout<<x<<endl;;
return 0;
}
快速幂
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
typedef long long ll;
ll ksm(ll a,ll b,ll c)
{
if(a==0) return 1;
if(a==1) return b;
ll ans=1;
while(b)
{
if(b%2==1)
{
ans*=a;
ans%=c;
}
b/=2;
a*=a;
a%=c;
}
return ans%c;
}
int main()
{
return 0;
}
线性筛素数
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
bool not_prime[101000];
int prime[101000],cnt,n;
int main()
{
scanf("%d",&n);
not_prime[1]=1;
for(int i=2;i<=n;i++)
{
if(!not_prime[i])
prime[++cnt]=i;
for(int j=1;j<=cnt;j++)
{
if(prime[j]*i>n) break;
not_prime[prime[j]*i]=1;
if(!i%prime[j]) break;
}
}
for(int i=1;i<=cnt;i++)
cout<<prime[i]<<" ";
return 0;
}