2012年3月18日
hoj1249 Optimal Array Multiplication Sequence
摘要： /*This Code is Submitted by billforum for Problem 1249 at 2012-03-18 18:47:08*/#include <iostream>#include <cstring>#include <cstdio>using namespace std;const int N=15;const int MAX=100000000;int x[N],m[N][N],d[N][N];void print(int i,int j){ if(i==j) printf("A%d",i); else 阅读全文
posted @ 2012-03-18 18:51 wuzhibin 阅读(198) 评论(0) 推荐(0)