Lesroad

【题目大意】 给定长度微n的数列整数及整数s。求出总和不小于s的连续子序列的长度的最小值。如果节不存在，则输出0。 思路：sums，l右移 #include #include #include #include using namespace std; const int MAXN=100000+50; int num[MAXN],n,s; void solve() { scan

Jessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little time on it. If she wants to pass it, she has to master all ideas incl