路径打印&最少乘法次数
#include #include #include #include #include #include #include #include #include #include #include #include #define INF 0x3f3f3f3f#define e 2.718281828459#define eps 1e-10using namespace std;typedef long long ll;static const int MAX_N = 1e3 + 5;static const ll Mod = 2009;int dp[MAX_N][MAX_N];int path[MAX_N][MAX_N];int a[MAX_N];void print_path(int i, int j) {if (i == j) return;print_path(i, path[i][j]);print_path(path[i][j] + 1, j);printf("A[%d:%d] * A[%d:%d]\n", i, path[i][j], path[i][j] + 1, j);}int main() {/* freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);*/int n;while (scanf("%d", &n) != EOF) {for (int i = 0; i }