//必须特判一下特殊情况,只有起始点和终点。。。。。。 #include<stdio.h> int L,M,N,a[500050]; int judge(int x)//判断距离为x时,此时可不可行 { int i=0; int stand=0,ans=0; while(i<N) { while(i<N&&a[i]-stand<x)
River Hopscotch(查看题目) Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11391 Accepted: 4890 Description Every year the cows hold an event featuring a peculiar version of hopscot