zhoubiyu
diff --git a/‎C++/.DS_Store
6 KB b/‎C++/.DS_Store
6 KB
diff --git a/‎C++/chapDynamicProgramming.tex
Lines changed: 1 addition & 1 deletion b/‎C++/chapDynamicProgramming.tex
Lines changed: 1 addition & 1 deletion
diff --git a/‎C++/images/.DS_Store
6 KB b/‎C++/images/.DS_Store
6 KB
@@ -25,7 +25,7 @@ \subsubsection{描述}
 \subsubsection{分析}
 设状态为$f(i, j)$，表示从从位置$(i,j)$出发，路径的最小和，则状态转移方程为
 $$
-f(i,j)=\min\left\{f(i,j+1),f(i+1,j+1)\right\}+(i,j)
+f(i,j)=\min\left\{f(i+1,j),f(i+1,j+1)\right\}+(i,j)
 $$