枫_root

分类

/ 注册

全部文章（共24篇）

题解 | 滑雪

#include <stdio.h> #include <string.h> int n, m; int direction[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; int dfs_path(int heigh_1[][m],...

2025-05-05

0 18

题解 | 合唱队形

#include <stdio.h> int main() { int n; scanf("%d", &n); int arr[n]; int dp_l[n]; int dp_r[n]; for (int i ...

2025-05-04

0 28

题解 | 拦截导弹

#include <stdio.h> #include <stdlib.h> int main() { int n; int system_count = 0; scanf("%d", &n); int system...

2025-05-04

0 22

题解 | 矩阵的最小路径和

#include <stdio.h> #include <stdlib.h> int main() { int n, m; scanf("%d %d", &n, &m); int cost[n][m]; i...

2025-05-01

0 26

题解 | 最小花费爬楼梯

#include <stdio.h> int main() { int n; scanf("%d", &n); int dp[n + 1]; int cost[n]; for (int i = 0; i < n;...

2025-05-01

0 25

题解 | 跳台阶扩展问题

#include <stdio.h> int main() { int n; scanf("%d",&n); int dp[n+1]; dp[0]=0; dp[1]=1; for(int i=2;i<=n...

2025-04-30

0 23

题解 | 斐波那契数列

#include <stdio.h> int main() { int n; scanf("%d", &n); int fib[n + 1]; fib[0] = 0; fib[1] = 1, fib[2] = 1; ...

2025-04-30

0 28

题解 | 最长公共子序列(一)

#include <stdio.h> #include <stdlib.h> int main() { int n, m; scanf("%d %d", &n, &m); char* str1 = (char*)m...

2025-04-30

0 32

题解 | 最长上升子序列(一)

#include <stdio.h> int main() { int n; scanf("%d", &n); int arr[n]; int dp[n]; for (int i = 0; i < n; i++)...

2025-04-28

0 22

题解 | 连续子数组最大和

#include <stdio.h> int main() { int n; scanf("%d", &n); int a[n]; int dp[n]; for (int i = 0; i < n; i++) {...

2025-04-27

0 27