摘要： 简单dphttp://acm.hdu.edu.cn/showproblem.php?pid=1864#include<iostream>#include<string>using namespace std;double dp[50];double max(double a,double b){ return a>b?a:b;}int main(){ int m,n,j,i; double val,A,B,C; char c; double v; double sum[30]; int flag; while(cin>>val>>n& 阅读全文