Gragon_sgirlfriend的博客

#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; long long a[500010],sum,tmp,b[500010],n; int main() { while(scanf("%lld",...

//会用map真的很好 #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <map> using namespace std; map <int,int> p;//这是大佬想出来的 太棒了 int zhu...

#include <iostream> #include <cstdio> #include <cstring> using namespace std; const int N=1e6+5; int sum[4*N],lsum[4*N],rsum[4*N],a[N]; int n,m; void pushdown(int k,int l,int r) { ...

#include <iostream> #include <cstdio> #include <cstring> using namespace std; const int N=1e5+5; int sum[4*N],lsum[4*N],rsum[4*N],a[N];//连续的上升序列，考试的时候没看清题就做了 int n,m; void pushdown(i...

//O(n^2)很好想 #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; int n,ans,a[100005],b[100005],c[100005],tmp=0; int main() { n...

//第一次发博客哈哈哈哈哈，这是参考大佬的做法，很棒的做法 //最长上身子序列 //luogu P1091 include include include include using namespace std; int main() { int n,a[105],b[105][5],d; scanf(“%d”,&n); ...