- 博客(151)
- 收藏
- 关注
RSS订阅原创 练习2 - 扩散
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>#include <map> using namespace std;#define L 101#define MAX 0x3fint m,n;//int g[L][L]; //占位 int .
2020-08-19 12:25:39
214
原创 练习4 - 家庭作业
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101#define MAX 0x3fint n;struct homework{ int date; int score;}a[L];in.
2020-08-19 12:24:06
154
原创 练习2 - 数列分段
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101#define MAX 0x3fint n,m,x;int a[L];int ans=1,t;bool comp(int a,int b.
2020-08-19 12:23:18
141
原创 练习1 - 数列极差
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101#define MAX 0x3fint n;int a[L];int maxl=0;int minl=0;bool comp(int .
2020-08-19 12:22:29
309
原创 练习1 - 烦人的幻灯片
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101#define MAX 0x3fint n;int a[L][4],x,y; int g1[L][L],g2[L][L]; //数字+字母 .
2020-08-19 12:21:18
145
原创 练习4 - 连接格点(智障大法)
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101#define MAX 0x3fint m=2,n=2;typedef struct point;typedef point *node;.
2020-08-17 12:51:18
148
原创 练习1 - 局域网(net)
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101#define MAX 0x3fint n,k; int father[L];int begin,end,len,k1,k2;struct.
2020-08-17 12:48:31
112
原创 练习3 - 搭配购买
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101#define MAX 0x3fint n,m,W; int father[L];int c,w,wc[L][2],allCw[L][2],.
2020-08-17 12:47:25
145
原创 练习1 - 刻录光盘
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101#define MAX 0x3fint n; int g[L][L];int f[L]; //是否到过 int q[L]; //深搜占位 .
2020-08-17 12:45:02
142
原创 练习3 - 铲雪车(snow)
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101 int F,N;int x,y;int g[L][L]; //记录路径 int ans[L]; //记录路径int len=0; bo.
2020-08-12 12:47:50
515
原创 练习1 - 珍珠(bead)
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101 int N,M;int x,y;int g[L][L]; //记录路径 int m;int sum;int f[L]; //桶排 =&.
2020-08-12 12:46:44
328
原创 练习1 - 合并果子(fruit)
练习1#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101int heap[L]; //模拟堆 const int N =10;int b[N+1]={0,3,5,1,7,6,4,2,5,4.
2020-08-12 12:44:39
327
原创 练习4 - 二叉树输出
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101typedef struct node;typedef node *tree; //tree => &node;tree本身就代表.
2020-08-10 12:52:31
186
原创 练习3 - FBI树
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101typedef struct node;typedef node *tree; //tree => &node;tree本身就代表.
2020-08-10 12:50:34
112
原创 练习2 - 二叉树遍历
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101typedef struct node;typedef node *tree; //tree => &node;tree本身就代表.
2020-08-10 12:49:44
103
原创 练习1 - 小球
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101typedef struct node;typedef node *tree; //tree => &node;tree本身就代表.
2020-08-10 12:48:36
165
原创 练习4 - 家庭问题
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101const int N=6,K=3;int a[K+1][2]={ {0,0}, {1,2}, {1,3}, {4,5}};int.
2020-08-10 12:46:39
149
原创 练习2 - 奇怪的电梯
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101const int N=5,A=1,B=5;int a[N+1]={0,3,3,1,2,5};int head=0,tail=1; //ta.
2020-08-10 12:45:22
195
原创 练习4 - 计算(calc)
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101int topS=0; //指针指向空白处 // --再运算 int topN=0; char sym[L]; //符号栈int num[L.
2020-08-08 12:54:33
282
原创 练习3 - 字符串匹配问题(strs)
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101int top=0; char a[L]; //栈char b; int len = 0;bool flag = true;int ..
2020-08-08 12:52:34
648
原创 练习2 - 括弧匹配检验(check)
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101int top=0; char a[L]; //栈char b[L]; bool flag = true;int i=0; //升级变量.
2020-08-08 12:51:49
904
原创 练习1 - 表达式括号匹配(stack)
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101int top=0; //仿栈 char a;bool flag = true;int main(){ int i=0; //用a.
2020-08-08 12:50:43
181
原创 练习4 - 鸡蛋的硬度
#include <cstdio>#include <algorithm>#include <cstring>using namespace std;const int Tmax=105,inf=0x3f3f3f3f;int f[Tmax][Tmax];int dp(int n,int m){ if(f[n][m]<inf) return f[n][m];//如果已经算过了就不需要再算了 , if(m==1) return f[n][.
2020-08-08 12:49:02
181
原创 练习3 - 糖果
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101const int N=5,K=7; int a[L+1]={0,1,2,3,4,5};int f[L][L];//f[i][j]表示前i个.
2020-08-05 12:56:23
167
原创 练习2 - 计算字符串距离
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101const int AL=5;const int BL=5;char a[AL+2]=".mnklj";char b[BL+2]=".j.
2020-08-05 12:55:47
112
原创 练习1 - 公共子序列
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101const int AL=7;const int BL=6;int f[L][L];char z[L][L][L]; //1维char存储.
2020-08-05 12:54:50
167
原创 练习4 - 买书
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;#define L 1001const int Q=20,N=4;int a[N+1]={0,10,20,50,100};//f[数字和]long long f[L]; //初始化为0 => 无所畏惧 i.
2020-08-05 12:53:23
135
原创 练习3 - 宠物小精灵之收服
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;const int N=10,M=100,K=5; //N个精灵球 M体力值 K个精灵 int n[K+1]={0,7,2,2,1,4};int m[K+1]={0,10,40,50,20,20};//f[用的.
2020-08-05 12:52:48
300
原创 练习2 - 数字组合
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;const int T=70,N=3;int w[N+1]={0,71,69,1};int c[N+1]={0,100,1,2};//f[时间]int f[N+1]={0}; //初始化为0 => 无所畏惧.
2020-08-05 12:51:45
205
原创 练习1 - 采药
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;const int T=70,N=3;int w[N+1]={0,71,69,1};int c[N+1]={0,100,1,2};//f[时间]int f[N+1]={0}; //初始化为0 => 无所畏惧.
2020-08-05 12:51:02
132
原创 练习4 - 摘花生
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;int W=0,H=0; //h为有几列int a[101][101] = {0}; int f[101][101] = {0}; //用来存量 int g[101][101] = {0}; //用来占位 int.
2020-07-31 16:27:10
131
原创 练习3 - 登山
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;int n=0;int a[101] = {0}; int bf[101]; int cf[101];int maxx=0;int main(){ //输入数据 cin >> n; for(i.
2020-07-31 16:26:27
115
原创 练习2 - 最大子矩阵
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;const int N=4;int a[N+1][N+1]={ {0,0,0,0,0}, {0,0,-2,-7,0}, {0,9,2,-6,2}, {0,-4,1,-4,1}, {0,-1,8,0,-2}}.
2020-07-31 16:25:33
141
原创 练习1 - 最长上升子序列
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;int n=0;int a[101]={0};int f[101]; //存量效应 int main(){ //输入数据 cin >> n; for(int i=1;i<=n;.
2020-07-31 16:24:51
166
原创 练习3 - The Castle(高端转化)
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;const int W=4,H=7; //H为现实中的第几列 int a[W][H]={ {11,6,11,6,3,10,6}, {7,9,6,13,5,15,5}, {1,10,12,7,13,7,5}, {.
2020-07-30 15:32:08
190
原创 练习1 - Dungeon Master(三维迷宫)
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;const int F=3,W=4,H=5; //H为现实中的第几列 char a[F][W][H]={ { {'S','.','.','.','.'}, {'.','#','#','#','.'}, {.
2020-07-29 21:29:12
221
原创 练习5 - 一元三次方程求解
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;float a,b,c,d;float f(float x){ return ((a*x*x*x) + (b*x*x) + (c*x) + d);}void gen(float l,float h){ if(.
2020-07-29 14:04:04
223
原创 练习4 - 求排列的逆序数
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[101] = {0};int r[101] = {0};//用来临时存储 int N=0;int t=0; //存储逆序对 void qsort(int l,int h){ if(l>=h) return; //已为单元素区间 =>.
2020-07-28 22:18:15
304
原创 练习7 - 电池的寿命
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int N=4;int a[N]={3,3,3,5};float s=0;int main(){ if(N==2){ if(a[0]==a[1]){ cout << a[0]; //相同电池全部ok }else{ .
2020-07-28 20:49:55
583
原创 练习6 - 书架
#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int N=6;const int H=40;int a[N]={6,18,11,13,19,11};int s=0;bool comp(int a,int b){ return a>b;}int main(){ //①从大-&.
2020-07-28 20:25:27
101
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人