喵喵喵？

Subsequence Time limit 1000 ms Memory limit 65536 kB Description Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions

唉，好久没更新博客了，说明我这段时间在学习上都懈怠了Σ( ° △ °|||)︴昨天打了场金马赛，这网络…..我真的是无力吐槽…..前三题都是大水题，就不挂代码了；D-快速幂取模裸题#include<bits/stdc++.h> using namespace std; typedef long long ll; const int mod=1000000007; ll MOD(ll a,ll b,l

Training little cats time limit per test 2 seconds memory limit per test 256 megabytes Description Given an array having N elements, each element is either -1 or 1. You have M queries, each q

  传送门 这题其实没有题面看起来复杂，实际上我们贪心的去想：对于下式                                                                            如果我们有这么一种操作可以把某个减一，现在问一次操作后S的最小值, 那么很容易便可以知道我们肯定是去找最大的那个去减一，最后的结果才会最小. 对于这道题其...