[递推dp] zoj 3747 Attack on Titans

最新推荐文章于 2024-03-17 18:03:21 发布

原创

最新推荐文章于 2024-03-17 18:03:21 发布 · 7.9k 阅读

4 ·

CC 4.0 BY-SA版权

该博客介绍了一个关于如何使用动态规划方法解决「Attack on Titans」问题的编程挑战，涉及士兵分配策略，确保至少有m个连续的Garrison成员和不超过k个连续的Recon Corp成员的排列方式计算。通过递推公式详细解析了如何处理至少和至多连续条件的动态规划状态转移。

题目链接：

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5170

Attack on Titans

Time Limit: 2 Seconds Memory Limit: 65536 KB

Over centuries ago, mankind faced a new enemy, the Titans. The difference of power between mankind and their newfound enemy was overwhelming. Soon, mankind was driven to the brink of extinction. Luckily, the surviving humans managed to build three walls: Wall Maria, Wall Rose and Wall Sina. Owing to the protection of the walls, they lived in peace for more than one hundred years.

But not for long, a colossal Titan appeared out of nowhere. Instantly, the walls were shattered, along with the illusory peace of everyday life. Wall Maria was abandoned and human activity was pushed back to Wall Rose. Then mankind began to realize, hiding behind the walls equaled to death and they should manage an attack on the Titans.