帅呆呆～

分类

题解(41)

/ 注册

全部文章（共41篇）

题解 | #最大上升子序列和#

#include<iostream> #include<cstdio> using namespace std; const int MAXN = 1000 + 10; int arr[MAXN]; int dp[MAXN]; //备忘录数组 int main(...

C++

2022-03-15

0 296

题解 | #最大序列和#

#include<iostream> #include<cstdio> using namespace std; const int MAXN = 1e7 + 10; long long arr[MAXN]; long long dp[MAXN]; //记忆化数组，...

C++

2022-03-14

0 239

题解 | #还是畅通工程#

#include<iostream> #include<cstdio> #include<algorithm> using namespace std; const int MAXN = 1000; struct Edge{ //定义边结构体 in...

C++

2022-03-13

2 407

题解 | #连通图#

#include<iostream> #include<cstdio> using namespace std; const int MAXN = 1000; int father[MAXN]; int height[MAXN]; void Initial(int ...

C++

2022-03-13

0 289

题解 | #查找学生信息#

#include<iostream> #include<cstdio> #include<map> #include<string> using namespace std; int main() { int n; scanf("%d",&am...

C++

2022-03-13

0 292

题解 | #哈夫曼树#

#include<iostream> #include<cstdio> #include<queue> using namespace std; int main() { int n; while(scanf("%d",&n) != EOF) {...

C++

2022-03-12

1 364

题解 | #复数集合#

#include<iostream> #include<cstdio> #include<queue> using namespace std; //定义复数结构体 struct Complex { int real; //实部 int imag;...

C++

2022-03-12

0 255

题解 | #二叉排序树#

#include<iostream> #include<cstdio> #include<string> using namespace std; struct TreeNode { int data; TreeNode* leftChild; Tree...

C++

2022-03-12

0 342

题解 | #Fibonacci（矩阵快速幂法）#

#include<iostream> #include<cstdio> using namespace std; const int MAXN = 10; struct Matrix { int row; int col; int matrix[MAXN][MAX...

C++

2022-03-11

4 291

题解 | #N的阶乘#

#include <iostream> #include <cstdio> #include <string> #include <cstring> using namespace std; const int MAXN = 10000; str...

C++

2022-03-09

5 354