SF

<p class="MsoNormal"> <span style="font-family:宋体;">现有一条单向公路，在路的一侧种有</span><span>N</span><span style="font-family:宋体;">（</span><span>2&lt;=N&lt;=25</span><span style="font-family:宋体;">）颗特殊花种（</span><span>SF</span><span style="font-family:宋体;">），由于天气原因，</span><span><span>Tom</span></span><span></span><span></span><span style="font-family:宋体;">只有</span><span>h</span><span style="font-family:宋体;">小时</span><span>(1&lt;=h&lt;=16)</span><span style="font-family:宋体;">的时间收集</span><span>SF</span><span style="font-family:宋体;">的种子，这是因为</span><span>SF</span><span style="font-family:宋体;">种子被雨淋后将失去研究价值。现在，</span><span>Tom</span><span style="font-family:宋体;">位于第</span><span>1</span><span style="font-family:宋体;">株</span><span>SF</span><span style="font-family:宋体;">的位置，他可以采摘任意一株</span><span>SF</span><span style="font-family:宋体;">的种子。从第</span><span>i</span><span style="font-family:宋体;">株</span><span>SF</span><span style="font-family:宋体;">到达第</span><span>i+1</span><span style="font-family:宋体;">株的位置，需要花费的时间单元个数为</span><span>t</span><span style="font-family:宋体;">（此处时间单元为</span><span>5</span><span style="font-family:宋体;">分钟），即表示花费时间</span><span>Ti=5*t</span><span style="font-family:宋体;">（其中</span><span>i=0..n-1,0&lt;Ti&lt;=960,</span><span style="font-family:宋体;">如</span><span>t=4</span><span style="font-family:宋体;">，</span><span>T5=t*5=20,</span><span style="font-family:宋体;">表示从第</span><span>4</span><span style="font-family:宋体;">株</span><span>SF</span><span style="font-family:宋体;">到达第</span><span>5</span><span style="font-family:宋体;">株</span><span>SF</span><span style="font-family:宋体;">需要花费</span><span>20</span><span style="font-family:宋体;">分钟）。</span><span>Tom</span><span style="font-family:宋体;">可有选择地收集途径过程</span><span>SF</span><span style="font-family:宋体;">的种子，但由于收集难度，每</span><span>5</span><span style="font-family:宋体;">分钟，他只能收集</span><span>Fi</span><span style="font-family:宋体;">颗</span><span>SF</span><span style="font-family:宋体;">的种子（很苦哈）。天气越来较差，使得</span><span>Tom</span><span style="font-family:宋体;">在收集</span><span>SF</span><span style="font-family:宋体;">的种子过程中会掉落部分种子（更苦了，收集效率还下降），假设</span><span>Tom</span><span style="font-family:宋体;">每</span><span>1</span><span style="font-family:宋体;">个时间单元掉落个数增加</span><span>Di</span><span style="font-family:宋体;">（掉落的没有收集价值，如果某</span><span>SF</span><span style="font-family:宋体;">的</span><span>Fi</span><span style="font-family:宋体;">小于等于</span><span>Di,5</span><span style="font-family:宋体;">分钟后，每一时间单元可收集种子个数将为</span><span>0</span><span style="font-family:宋体;">）。</span> </p> <p class="MsoNormal"> <span>Tom</span><span style="font-family:宋体;">为了使损失最小，尽量多地收集种子，</span><span>Tom</span><span style="font-family:宋体;">需要进行简单的规划。现在请你帮他设计一程序，求取在</span><span>SF</span><span style="font-family:宋体;">种子收集数最大的前提下，</span><span>Tom</span><span style="font-family:宋体;">在每个</span><span>SF</span><span style="font-family:宋体;">停留的时间。</span> </p> <p class="MsoNormal"> <span style="font-family:宋体;">注意：在每个</span><span>SF</span><span style="font-family:宋体;">停留的时间，均为</span><span>5</span><span style="font-family:宋体;">的倍数。SF种子满足方案要求，即可认为种子数目极多。</span> </p>

<p class="MsoNormal"> <span style="font-family:宋体;">每组数据第</span><span>1</span><span style="font-family:宋体;">行为</span><span>N</span><span style="font-family:宋体;">，</span><span>h</span><span style="font-family:宋体;">，之后的</span><span>3</span><span style="font-family:宋体;">行为</span><span>i</span><span style="font-family:宋体;">处收集</span><span>SF</span><span style="font-family:宋体;">种子的详细情况。</span> </p> <p class="MsoNormal"> <span style="font-family:宋体;">第</span><span>(1</span><span style="font-family:宋体;">）行为每一个时间单元</span><span>,</span><span style="font-family:宋体;">可收集第</span><span>i</span><span style="font-family:宋体;">株</span><span>SF</span><span style="font-family:宋体;">种子数</span><span>Fi</span><span style="font-family:宋体;">（</span><span>i=1..N</span><span style="font-family:宋体;">）</span><span>,</span> </p> <p class="MsoNormal"> <span style="font-family:宋体;">第</span><span>(2) </span><span style="font-family:宋体;">行为</span><span>Tom</span><span style="font-family:宋体;">在收集第</span><span>i</span><span style="font-family:宋体;">株</span><span>SF</span><span style="font-family:宋体;">种子的过程中，每一个时间单元掉落SF种子个数的增加量</span><span>Di</span><span style="font-family:宋体;">（</span><span>i=1..N</span><span style="font-family:宋体;">）</span><span>,</span> </p> <p class="MsoNormal"> <span style="font-family:宋体;">第</span><span>(3) </span><span style="font-family:宋体;">行为</span><span>Tom</span><span style="font-family:宋体;">从第</span><span>i</span><span style="font-family:宋体;">株</span><span>SF</span><span style="font-family:宋体;">走到第</span><span>i+1</span><span style="font-family:宋体;">株所需要花费的时间（</span><span>i=1..N-1</span><span style="font-family:宋体;">）。</span> </p> <p class="MsoNormal"> <span style="font-family:宋体;"> </span> </p> <p class="MsoNormal"> <span style="font-family:宋体;">数据的输入以</span><span>0</span><span style="font-family:宋体;">结束。</span> </p> <br /> <p> <br /> </p>

<p class="MsoNormal"> <span style="font-family:宋体;">每组数据输出</span><span>2</span><span style="font-family:宋体;">行，</span> </p> <p class="MsoNormal"> <span style="font-family:宋体;">第</span><span>1</span><span style="font-family:宋体;">行输出在</span><span>Tom</span><span style="font-family:宋体;">需在每个</span><span>SF</span><span style="font-family:宋体;">停留的时间，</span> </p> <p class="MsoNormal"> <span style="font-family:宋体;">第</span><span>2</span><span style="font-family:宋体;">行输出</span><span>Tom</span><span style="font-family:宋体;">可收集到最大种子数。</span> </p> <p class="MsoNormal"> <span style="font-family:宋体;">如果方案存在，尽可能地多的停留在第</span><span>1</span><span style="font-family:宋体;">株</span><span>SF</span><span style="font-family:宋体;">处</span><span>(</span><span style="font-family:宋体;">人懒哈</span><span>)</span><span style="font-family:宋体;">，如果还有方案与其平局，需尽可能地停留在第</span><span>2</span><span style="font-family:宋体;">株</span><span>SF</span><span style="font-family:宋体;">处，依次类推。</span> </p>