前言

依旧想去德育基地…

成绩

$R a n k$	$P e r s o n$	$S c o r e$	$A$	$B$	$C$
$1$	$2017 x x y$	$210$	$40$	$100$	$70$
$2$	$2017 m y s e l f$	$190$	$20$	$100$	$70$
$3$	$2017 l x f$	$180$	$0$	$90$	$90$
$4$	$2017 z y c$	$170$	$0$	$100$	$70$
$5$	$2017 z y x$	$150$	$40$	$60$	$50$
$6$	$2017 x j q$	$130$	$0$	$100$	$30$
$7$	$2017 l r z$	$100$	$10$	$90$	$0$
$7$	$2013 l y k$	$100$	$0$	$100$	$0$
$9$	$2015 z y f$	$90$	$20$	$0$	$70$
$10$	$2013 l x h$	$90$	$0$	$90$	$0$

正题

$T 1 : n s s l 1254 - A ($ 林下风气 $)$ 【树形 $d p$ 】

博客链接:

$T 2 : n s s l 1255 - B ($ 轻功 $)$ 【 $S P F A,$ 分层图】

博客链接:

$T 3 : n s s l 1256 - C ($ 盟主的忧虑 $)$ 【并查集】

博客链接:

$some\ of\ code$

T2 20分code

#include
   
    #include
    
     #include
     
      #define N 4000#define XJQ 19260817using namespace std;struct node{
   	int to,next;}a[N];int ls[N],w[N],maxs,mins,ans,n,k,tot,x,y,in[N];void addl(int x,int y){
   	a[++tot].to=y;	a[tot].next=ls[x];	ls[x]=tot;}void dp1(){
   	for(int i=1;i<=n;i++)	{
   		maxs=0;		mins=2147483647;		for(int j=i;j<=n;j++)		{
   			maxs=max(maxs,w[j]);			mins=min(mins,w[j]);			if(maxs-mins==k) ans++;		}	}	printf("%d",ans);}int main(){
   	scanf("%d%d",&n,&k);	for(int i=1;i<=n;i++)	    scanf("%d",&w[i]);	for(int i=1;i

T3 70分code

#include
   
    #include
    
     #define N 100010using namespace std;struct node{
   	int to,w,next,from;}a[N];int ls[N],tot,x,y,w,ans,dep[N],n,m,S,dfn[N],end[N],cnt;void addl(int x,int y,int w){
   	a[++tot].to=y;a[tot].w=w;	a[tot].next=ls[x];ls[x]=tot;	a[tot].from=x;}void dfs(int x,int fa){
   	dfn[x]=++cnt;	dep[x]=dep[fa]+1;	for(int i=ls[x];i;i=a[i].next)	  if(i
     
      dep[a[x].to]) x++;	return x;}int main(){
   	scanf("%d%d",&n,&m);	for(int i=1;i
      
       =dfn[x]&&dfn[a[j].to]<=end[x]&&		  (dfn[a[j].from]
       
        end[x])		  ||			dfn[a[j].from]>=dfn[x]&&dfn[a[j].from]<=end[x]&&		  (dfn[a[j].to]
        
         end[x])) ans=min(ans,a[j].w); if(ans==2147483647) printf("-1\n"); else printf("%d\n",ans); }}