该博客介绍了一个使用动态规划求解关于三辆汽车递送杂志的最短路径问题。每辆车只能在前一辆车完成递送后才能前往下一个地点。博客给出了输入输出格式，并展示了C++代码实现，通过三维数组DP来计算最小成本。
Magazine Delivery
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 1590 | Accepted: 766 |
Description
The TTT Taxi Service in Tehran is required to deliver some magazines to N locations in Tehran. The locations are labeled L1 to LN. TTT assigns 3 cars for this service. At time 0, all the 3 cars and magazines are located at L1. There are plenty of magazines available in L1 and the cars can take as many as they want. Copies of the magazine should be delivered to all locations, observing the following rules:
- For all i = 2 .. N, magazines should be delivered at Li only after magazines are deliv
最低0.47元/天 解锁文章
扫一扫
1237
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
