摘要:
I - Period Problem Description For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), 阅读全文
摘要:
不要被线段树这个名字和其长长的代码吓到。 D - Balanced Lineup Description For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. On 阅读全文
摘要:
头炸了啊,只做出L题,前两天刚看的Shawn zhou的博客学习的,幸亏看了啊,否则就爆零了,发现题目都是经典题,线段树,KMP,我都没看过,最近又在复习考研,真后悔大一大二没好好学习啊,得抽时间好好补一下了。还报名了蓝桥杯啊,心里好没底。。。 #Title A Watto and Mechanis 阅读全文