51Nod 1083 矩陣取數問題 | 動態規劃

      #include "bits/stdc++.h" using namespace std; #define LL long long #define INF 0x3f3f3f3f3f #define PI acos(-1) #define N 510 #define MOD 10 using namespace std; int arr[N+1][N+1],dp[N+1][N+1];

>>阅读原文<<