牛客126208132号

分类

题解(1)

/ 注册

全部文章（共9篇）

题解 | 无人机物流网络最优路径规划

#include <bits/stdc++.h> using namespace std; typedef pair<int,int> pii; const int N = 1e3 + 10; const int M = 1e6 + 10; const int inf ...

2026-01-10

0 10

题解 | 晶体能量阱储量计算

#include <bits/stdc++.h> using namespace std; const int N = 305; const int inf = 0x3f3f3f3f; const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -...

2026-01-05

0 13

题解 | 神经网络信号传播预测

#include <bits/stdc++.h> using namespace std; const int N = 105; const int inf = 0x3f3f3f3f; const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -...

2026-01-05

0 13

题解 | 能量共振

#include <bits/stdc++.h> using namespace std; typedef long long LL; const int N = 1e6 + 10; int n, res, cnt; LL a[N]; map<LL,int> mp, m...

2026-01-04

0 14

题解 | 奶茶店特调

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int n, m, a[N], pre[N]; int main() { ios :: sync_with_stdio(false)...

2026-01-03

0 15

题解 | 变化的数组

#include<bits/stdc++.h> using namespace std; typedef long long LL; const int N = 1e5 + 10, mod = 1e9 + 7; LL n, m, k; LL ksm(LL x, LL y) { ...

2025-06-26

0 43

题解 | Sudoku

暴力枚举 #include <bits/stdc++.h> using namespace std; int a[10][10]; bool dfs(int n) { if(n >= 81) return true; int x = n / 9, y = n ...

2025-06-25

0 55

题解 | 素数伴侣

#include<bits/stdc++.h> using namespace std; const int N = 110, M = 6e4 + 10; int n, a[N], st[M], primes[M], cnt; bool vis[N]; int match[N], ...

2025-06-25

0 68

题解 | #小红的最大中位数#

选的最大值个数比其他数至少多一个即可 #include <bits/stdc++.h> #define ll long long using namespace std; const int N = 1e5 + 10, mod = 1e9 + 7; int n, maxx; uno...

C++

2025-03-08

0 73