欢乐纪中某B组赛【2019.1.25】

前言

还算 $O K$

成绩

$R a n k$ 是有算别人的

$R a n k$	$P e r s o n$	$S c o r e$	$A$	$B$	$C$
$4$	$2017 m y s e l f$	$180$	$100$	$80$	$0$
$5$	$2017 z y c$	$160$	$60$	$100$	$0$
$11$	$2017 h z b$	$140$	$60$	$80$	$0$
$15$	$2017 x x y$	$115$	$15$	$100$	$0$
$31$	$2017 x j q$	$100$	$0$	$100$	$0$
$72$	$2017 l w$	$30$	$0$	$30$	$0$
$87$	$2017 l r z$	$5$	$0$	$5$	$0$
$93$	$2017 h j q$	$0$	$0$	$0$	$0$

正题

$T 1 : P 3365, j z o j 3894 -$ 改造二叉树【 $L I S, B S T$ 】

博客链接:
https://blog.csdn.net/Mr_wuyongcong/article/details/86648465

$T 2 : j z o j 3895 -$ 数字对【 $R M Q, G C D,$ 二分答案 $,$ 单调队列】

博客链接:
https://blog.csdn.net/Mr_wuyongcong/article/details/86648570

$T 3 : j z o j 3896 -$ 战争游戏【 $t a r j a n,$ 割点 $,$ 点双联通分量】

博客链接:
https://blog.csdn.net/Mr_wuyongcong/article/details/86648677

$someofcodesome\ of\ code$

T2 暴力

#include<cstdio>
#include<algorithm>
#define N 500010
using namespace std;
int n,a[N],maxs,ans[N],tot;
int main()
{freopen("data.in","r",stdin);freopen("data.ans","w",stdout);scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);for(int i=1;i<=n;i++)for(int j=i;j<=n;j++)if(j-i>=maxs){int mins=2147483647,flag=true;for(int k=i;k<=j;k++)mins=min(mins,a[k]);for(int k=i;k<=j;k++)if(a[k]%mins){flag=false;break;}if(flag&&j-i>maxs){maxs=j-i;ans[1]=i;tot=1;}else if(flag) ans[++tot]=i;}printf("%d %d\n",tot,maxs);for(int i=1;i<=tot;i++)printf("%d ",ans[i]);
}

T2 随机数据

#include<cstdio>
#include<cstdlib>
#include<ctime>
using namespace std;
int main()
{freopen("data.in","w",stdout);srand(time(0));printf("500\n");for(int i=1;i<=500;i++)printf("%d ",2+rand()%1022);
}

T3 0分code

#include<cstdio>
#include<cstring>
#define N 50010
using namespace std;
struct node{int to,next;
}a[N*4];
int n,m,f[N],v[N],ls[N],tot,ans,s;
void addl(int x,int y)
{a[++tot].to=y;a[tot].next=ls[x];ls[x]=tot;
}
int dfs(int x){if(v[x]) return 0;v[x]=true;f[x]=1;for(int i=ls[x];i;i=a[i].next){int y=a[i].to;int k=dfs(y);if(x==s)ans+=f[x]*k;f[x]+=k;}return f[x];
}
int main()
{freopen("data.in","r",stdin);freopen("data.out","w",stdout);scanf("%d%d",&n,&m);for(int i=1;i<=m;i++){int x,y;scanf("%d%d",&x,&y);addl(x,y);addl(y,x);}for(int i=1;i<=n;i++){memset(v,0,sizeof(v));memset(f,0,sizeof(f));s=i;ans=0;dfs(i);printf("%d\n",ans);}
}