摘要:
解题思路:dpdp方程:[代码]//opt[i]=min{opt[j]+[a[j+1]+....+a[i]+10]*p[i]}//CodeCode highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/--#includeiostreamusing namespace std;#define MAXN 1e9int main(){ int n,i,j,c,m,t,a[100],p[100],opt[101]={0}; scanf("%d", &n); while 阅读全文