![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
h
橙子杉
For life ,for dream~
展开
-
1003求子序列(复杂度O()降到O(n))
#include <stdio.h> int main (){ int n,a,b,maxsum,temp,m,j=1; int num[1000]; scanf("%d",&n); while(n--){ if(j!=1)printf("\n"); scanf("%d",&m); for(int i=0;i<m;i++) ...原创 2018-07-15 16:38:24 · 143 阅读 · 0 评论 -
kruskal模板
#include <iostream> #include <cstdio> #include <cstdlib> #include <cmath> #include <string> #include <cstring> #include <algorithm> using namespace std; ...原创 2019-09-06 11:20:18 · 90 阅读 · 0 评论