浙师大OJ
emmm
青烟dark
这个作者很懒,什么都没留下…
展开
-
ZJNU 1361
树上两点最远距离 #include <bits/stdc++.h> using namespace std; const int bsz=1<<18; char bf[bsz], *head, *tail; inline char gc(){ if(head==tail){ int l=fread(bf,1,bsz,stdin); tail=(head=bf)+l;} return *head++;原创 2020-10-29 13:32:11 · 111 阅读 · 0 评论 -
RACE
RACE Descpription: Bessie is running a race of lenth K(1 <= K <= 1e9) meters.She starts running at a speed of 0 meters per second.In a given second,she can either increase her speed by 1 meter per second and run 1 meter ,or keep it at 0 meters per se原创 2020-07-08 01:18:19 · 138 阅读 · 0 评论