- 博客(8)
- 资源 (3)
- 收藏
- 关注
RSS订阅转载 最小生成树--prim算法
#include<iostream>#include<stdio.h>#include<string.h>using namespace std; int INF = 999999999;int G[110][110];int sta[110]; //以i为终点以visit的连通点为起点的最短边的起点 int low[110];//以i为终点...
2018-02-25 13:20:24
158
转载 迪杰特斯拉算法
#include <stdio.h>#include<stack>using namespace std;int main(){ int inf=99999999; int n,m; //n顶点个数，m边的条数 scanf("%d %d",&n,&m); int e[n+1][n+1]; ...
2018-02-24 20:10:04
882
原创 深度优先搜索
#include <cstdio>const int INT_MAX = 10000; const int MAX = 501;int wei[MAX];//weight quanzhiint visit[MAX];//visited or notint map[MAX][MAX];//distance between two pointsint mind;//min ...
2018-02-24 14:58:20
142
原创 素数筛
#include<stdio.h>#include<iostream>#include<cmath>#include<vector>#include<algorithm>using namespace std;int main(){ int n; cin>>n; bool isprime[n+1]; int...
2018-02-24 14:51:44
105
转载 Longest Increasing Subsequence
#include<stdio.h>#include<iostream>#include<cmath>#include<vector>#include<algorithm>using namespace std;int main(){ int n; cin>>n; int s[n+1]; for(int i=...
2018-02-24 11:56:03
116
原创 Longest Common Subsequence
#include<stdio.h>#include<iostream>#include<cmath>#include<vector>#include<algorithm>using namespace std;int main(){ int n,m; cin>>n>>m; string s1,s2
2018-02-23 21:20:35
173
原创 01背包和完全背包
#include<stdio.h>#include<iostream>#include<cmath>#include<vector>#include<algorithm>using namespace std;int main(){ int n,w; cin>>n>>w; int wei[n+
2018-02-23 19:50:06
113
原创 Fence Repair
#include<stdio.h>#include<iostream>#include<cmath>#include<vector>#include<algorithm>using namespace std;int main(){ int n; long long res=0,temp;//long long 类型，...
2018-02-23 16:00:40
151
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人