qq_36876305的博客

题目链接：http://hihocoder.com/problemset/problem/1685 题解：先枚举上下界，压缩成一维，转化为求最长的子段和且长度小于K。先预处理前缀和t[]，可转化为对于给定t[i],找到t[j]使得 t[j] - t[i-1] samin[p] - t[i-1] #include using namespace std; #define SZ(X)

题目链接：http://codeforces.com/problemset/problem/954/FF. Runner's Problemtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are running thro...