西区梭梭树

分类

/ 注册

全部文章（共50篇）

题解 | #最小邮票数#

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

2023-04-04

0 223

题解 | #求最大最小数#

排序最小的时间复杂度为O(nlogn);本题只需在一趟遍历中维护最大最小值即可，时间复杂度为O(n) #include <climits> #include <iostream> using namespace std; int main() { int n; ...

2023-03-31

0 274

题解 | #球的半径和体积#

#include <iostream> #include "cmath" using namespace std; struct point{ double x; double y; double z; point(double a,double b,do...

2023-03-31

0 266

题解 | #最大连续子序列#

动态规划，用结构体记录子序列起始元素和起始下标 #include <climits> #include <iostream> #include "vector" #include "algorithm" using namespace std; struct biggestS...

2023-03-27

0 271

题解 | #n的阶乘#

#include <iostream> using namespace std; long long factorial(int n) { if(n==0) return 1; return n*factorial(n-1); } int main() { int...

2023-03-22

0 227

题解 | #八进制#

#include <iostream> #include "vector" using namespace std; int main() { int a; while (cin >> a ) { // 注意 while 处理多个 case ...

2023-03-22

0 257

题解 | #排名#

#include <iostream> #include "vector" #include "queue" using namespace std; struct student { string num; int score; student(string s...

2023-03-21

0 290

题解 | #还是A+B#

#include <iostream> using namespace std; bool isSame(string a, string b, int k) { if (k > a.size()) k = a.size(); if ( k >...

2023-03-21

0 322

题解 | #日期差值#

#include <iostream> using namespace std; int daysTable[2][13] = {{0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}, {0, 31, 29, 31, 30, 31, 3...

2023-03-21

0 281

题解 | #字符串排序#

#include <iostream> #include <algorithm> using namespace std; bool compare(char a, char b) { if (a >= 'a' && a <= 'z') a = 'A' +...

2023-03-21

0 269