摘要:
//方程 dp[j]=min(dp[j],dp[i]+t+x/vt1+y/vt2);/*假设在第i个加油站充电,则到达第j个加油站的最优时间为dp[j].将终点设为最后一个加油站,起点设为第0个,特判起点。*/#include<cstdio>#include<cmath>#include<cstri 阅读全文
摘要:
//结构清晰,容易理解。 #include<cstdio>#include<cmath>#include<cstring>#include<queue>#include<stack>#include<cstdlib>#include<vector>#include<map>#include<stri 阅读全文
摘要:
题意:http://www.rqnoj.cn/problem/95 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3496 代码: 1 #include<cstdio> 2 #include<cmath> 3 #include<cstring> 4 # 阅读全文