牛客142529159号

分类

题解(1)

/ 注册

全部文章（共26篇）

题解 | #增高防护塔#

差分矩阵 #include "iostream" #include "algorithm" using namespace std; int main() { int d[110] = {0}; int n, m; cin >> n; for(int i ...

C++ 差分矩阵

2023-04-08

1 370

题解 | #乘积为正数的最长连续子数组#

#include <iostream> #include <algorithm> using namespace std; const int N = 1e5 + 10; int dp1[N], dp2[N]; // dp1[]连续乘积为正的最大长度，dp2[]连续乘积为负...

2023-03-20

0 345

题解 | #循环汉诺塔#

#include <iostream> // 87350326 887197658 444 using namespace std; typedef long long LL; const int N = 1e7; const long long p = 1000000007; LL h...

2023-03-19

1 344

题解 | #最小生成树Kruskal#

class Solution { static bool cmp(vector<int>& v1, vector<int>& v2) { return v1[2] < v2[2]; } vector<int> p; ...

2023-03-19

0 259

题解 | #分割等和子集# dfs

#include <iostream> #include <cstring> using namespace std; const int N = 510; int arr[N], n, target; bool dfs(int sum, int i) { if(su...

2023-03-19

0 346

题解 | #分割等和子集#

#include <iostream> #include <cstring> using namespace std; const int N = 510; int dp[100 * N], arr[N], n; int main() { int sum = 0; ...

2023-03-19

0 317

题解 | #最少的完全平方数#

#include <iostream> #include <cstring> #include <algorithm> using namespace std; const int N = 10010, INF = 0x3f; int a[N], cnt; int...

2023-03-19

0 327

题解 | #二叉搜索树#

#include <iostream> using namespace std; struct TreeNode { int val; TreeNode* left, *right; TreeNode() : left(nullptr), right(nullpt...

2023-03-19

0 360

题解 | #最大报销额#

#include <iostream> #include <queue> using namespace std; priority_queue<double> heap; double ans; //深搜回溯求最大和 //直接贪心取值无法ac，浮点数没法dp /...

2023-03-19

0 385

题解 | #Median#

#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { vector<int> v; int n, x;...

2023-03-19

0 330