威猛的磨洋工匠人allin实习

分类

/ 注册

全部文章（共39篇）

题解 | 最小邮票数

#include <cstring> #include <iostream> using namespace std; const int M = 105, N = 25; int m, n, p[N]; struct node { int cur, num, st...

2025-08-26

0 40

题解 | 点菜问题

#include <cstring> #include <iostream> using namespace std; const int C=1005, N=105; int c,n; int dp[N][C]; int p[N],v[N]; int main() { ...

2025-08-26

0 39

题解 | Coincidence

#include <iostream> #include<cstring> #include <string> using namespace std; const int N = 105; int dp[N][N]; int main() { str...

2025-08-25

0 37

题解 | 最大上升子序列和

#include <algorithm> #include <iostream> using namespace std; const int N = 1005; int dp[N],A[N]; int main() { int n; while (cin ...

2025-08-25

0 30

题解 | 拦截导弹

#include <algorithm> #include <iostream> using namespace std; const int N = 30; int s[N]; int dp[N]; int main() { int k; while (c...

2025-08-25

0 36

题解 | 最大序列和

#include <functional> #include <iostream> #include <algorithm> using namespace std;\ const int N = 1000010; using ll = long long; ...

2025-08-25

0 31

题解 | 吃糖果

#include <iostream> using namespace std; int dp[25]; int main() { int n; while (cin >> n) { dp[1]=1; dp[2]=2; ...

2025-08-24

0 36

题解 | N阶楼梯上楼问题

#include <iostream> using namespace std; int n,res; void dfs(int u){ if(n==0){ res++; return; } if(n<0)retu...

2025-08-24

0 25

题解 | 继续畅通工程

#include <algorithm> #include <iostream> using namespace std; const int N = 110; int n,m,p[N]; struct edge{ int a,b,w; }; int find(...

2025-08-23

0 32

题解 | 最短路径问题

#include <cstdio> #include <iostream> #include <cstring> using namespace std; int n,m; struct PII{ int d; //距离 int p; //花费 ...

2025-08-22

0 29