- 博客(29)
- 收藏
- 关注
RSS订阅原创 p3关键路径
#include<iostream>#include<cstdio>#include<queue>#include<vector>#include<cstring>#include<climits>using namespace std;const int maxn=1e5+7;const int INF=...
2020-03-27 23:16:31
124
原创 畅通工程续--最短路径
#include<iostream>#include<cstdio>#include<vector>#include<cstring>#include<queue>#include<climits>using namespace std;const int maxn=200;const int INF=INT...
2020-03-27 16:49:54
139
原创 还是畅通工程
#include<iostream>#include<cstdio>#include<queue>using namespace std;const int maxn=100; struct node{ int x; int y; int longg; node(int a,int b,int c) :x(a...
2020-03-27 11:39:11
114
原创 子串计算
using namespace std;int main(){ string str; while(cin>>str) { map<string,int>mymap; for(int i=0;i<str.size();i++) { for(int j=1;j<=s...
2020-03-26 23:45:50
422
原创 查找学生信息
#include<map>#include<iostream>#include<cstdio>#include<string>using namespace std;int main(){ int x,y; while(scanf("%d",&x)!=EOF) { getchar(); ...
2020-03-26 23:41:52
252
原创 哈夫曼树
#include<iostream>#include<cstdio>#include<queue>using namespace std;int main(){ int n; while(scanf("%d",&n)!=EOF) { priority_queue<int,vector<int&...
2020-03-26 20:05:02
84
原创 二叉排序树
#include<iostream>#include<cstdio>using namespace std;struct treenode{ int data; treenode * lchild; treenode * rchild; treenode(int c) :data(c) ,lchild(NULL) ...
2020-03-26 19:00:10
80
原创 二叉树遍历
#include<iostream>#include<cstdio>#include<string>using namespace std;struct treenode{char data;treenode *lchild;treenode *rchild;treenode(char c):data(c),lchild(NULL),rch...
2020-03-26 18:24:48
70
原创 二叉树遍历
#include<iostream>#include<cstdio>#include<string>using namespace std;struct treenode{char data;treenode* lchild;treenode* rchild;treenode(char c):data(c),lchild(NULL),rch...
2020-03-26 17:40:59
71
原创 整除问题---素数筛法
#include<iostream>#include<cstdio>#include<cstring>#include<vector>#include<map>#include<algorithm>using namespace std;const int maxn=1000;int xx[maxn];int...
2020-03-09 22:51:51
92
原创 大整数 十进制与二进制c++
#include<cstdio>#include<string>#include<iostream>#include<vector>using namespace std;string Di(string str,int x){ int n=0; for(int i=0;i<str.size();i++) ...
2020-03-09 18:06:24
169
原创 大整数 十进制转化为二进制c++
#include<cstdio>#include<string>#include<iostream>#include<vector>using namespace std;string Di(string str,int x){ int n=0; for(int i=0;i<str.size();i++) ...
2020-03-09 17:02:58
862
1
原创 递归--2的幂次方
#include<cstdio>#include<iostream>#include<vector>#include<string>using namespace std;string change(int x){ if(x==0) return "0"; if(x==1) return ""; ...
2020-03-09 16:31:52
197
原创 后缀子串排序c++
输入：grain输出：aingraininnrain#include<cstdio>#include<string>#include<set>#include<iostream>using namespace std;int main (){ string str; while(cin>>str) ...
2020-03-08 16:45:39
211
原创 Freckles最小生成树
#include<cstdio>#include<iostream>#include<string>#include<algorithm>#include<math.h>using namespace std;const int maxn=100;struct Edge{int from;int to;double...
2020-03-06 23:31:04
105
原创 找出直系亲属--c++
#include<cstdio>#include<iostream>#include<string>using namespace std;const int maxn=27;int son[maxn];void Initial(){ for(int i=0;i<maxn;i++) { son[i]=0; }}bo...
2020-03-06 19:41:29
513
原创 图论--并查集---畅通工程
并查集用来判断图是否为连通图#include<cstdio>#include<iostream>using namespace std;const int maxn=1000;int father[maxn];int height[maxn];void Initial(int n){ for(int i=0;i<=n;i++) { ...
2020-03-06 16:49:37
121
原创 01背包---最小邮票数
#include<cstdio>#include<iostream>#include<string>using namespace std;#define INF 1000000;const int maxn=1001;int dp[maxn];int v[maxn];int main(){ int n,m; while(scanf...
2020-03-04 15:11:04
117
原创 最长公共子序列c++
#include<cstdio>#include<iostream>#include<string>using namespace std;const int maxn=1001;int arr[maxn][maxn];string s1,s2;int main(){ while(cin>>s1>>s2){ ...
2020-03-03 19:45:05
189
原创 动态规划c++ ---合唱队列
#include<cstdio>#include<iostream>#include<vector>using namespace std;struct node{ int first; int last; node (int a,int b) :first(a) ,last(b) {}};vector<int...
2020-03-03 18:24:28
305
原创 最长递增子序列c++----动态规划
include<cstdio>#include<iostream>#include<vector>using namespace std;vector<int >m;vector<int >n;int main (){ int k; while(scanf("%d",&k)) { for(int i...
2020-03-03 17:44:13
486
原创 c++最大连续子序列和---动态规划
#include<cstdio>#include<iostream>#include<vector>using namespace std;vector<long long>m;vector<long long >n;int main (){ int x; while(cin>>x) { m...
2020-03-03 16:24:24
940
原创 c++吃糖果--动态规划
#include<cstdio>#include<iostream>using namespace std;int sum=0;void pr(int nn){ if(nn<0) { return ; } if(nn==0) { sum++; return; } pr(nn-1); ...
2020-03-03 11:55:39
788
原创 c++二叉树通过先序中序确定后序
#include<cstdio>#include<iostream>#include<string>using namespace std;struct node{ char data; node * ln; node * rn; node(char c) :data(c) ,ln(NULL) ,rn(NULL){}}...
2020-03-01 16:45:03
359
原创 c++二叉树-----先序建树和中序遍历
#表示空格输入：abc##de#g##f###（先序)输出：c b e g d f a （中序）#include<cstdio>#include<iostream>#include<string>using namespace std;struct node{ char data; node *ln; node *rn; no...
2020-03-01 15:51:46
396
原创 DFS神奇的口袋c++
#include <cstdio>#include<iostream>#include<vector>#include<algorithm>using namespace std;int num = 0;vector<int>s;void DFS(int sum, int position, int al){ ...
2020-03-01 12:58:16
308
1
原创 BFS问题----玛雅人的密码c++
典型的BFS问题#include<cstdio>#include<iostream>#include<map>#include<string>#include<queue>using namespace std;struct road{ string str;int l=0;};map<string,int >...
2020-02-29 19:04:12
194
原创 catch that cow 宽度优先搜索 c++
bfs的思想用了两个队列，队列m读入数，n读入状态，对应关系。相当于分割符，0101输入，当与上次出队列的数字不同时，说明到了下一层。counnt计数加1.#include<iostream>#include<cstdio>#include<queue>using namespace std;int main(){ int a,b; s...
2020-02-29 15:55:34
205
原创 c++字符串全排列
#include<string>#include<cstdio>#include<iostream>using namespace std;void pr(string str, int num){ if (num == str.size() - 1) { cout << str << endl;...
2020-02-29 13:24:06
1882
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人