文章目录算法标签：DP题目简叙思路代码AC截图算法标签：DP题目简叙思路1.i== 2|| j==2不可走2.边缘初始化一步3.当前
算法标签 线性DP题目简叙思路当前的状态由左上或者上方的两个点决定代码#include<iostream>using name
算法标签 动态规划题目思路数据N尽量拆分!最大不超过K1.初始化2.K>N 答st int N=110;int dp[N][N];int getAns(int n,
题目来源 计蒜客程序设计竞赛基础课（蓝桥杯省赛）算法标签 动态
Copyright © 2005-2025 51CTO.COM 版权所有 京ICP证060544号
![[第十一届蓝桥杯省赛C++B组]走方块](https://s2.51cto.com/images/blog/202303/20141935_6417faf74ceb961881.png?x-oss-process=image/resize,m_fixed,w_116,h_70/ignore-error,1)
![[AcWing]898. 数字三角形](https://s2.51cto.com/images/blog/202303/20141713_6417fa695164a27485.png?x-oss-process=image/resize,m_fixed,w_116,h_70/ignore-error,1)
![[计蒜客][动态规划]蒜头君爬楼梯](https://s2.51cto.com/images/blog/202303/20141954_6417fb0a43a9362319.png?x-oss-process=image/resize,m_fixed,w_116,h_70/ignore-error,1)
