HDU 2604 Queuing 解题报告（冷静讨论分析+矩阵快速幂）

最新推荐文章于 2020-02-23 16:57:50 发布

nowting_csdn

最新推荐文章于 2020-02-23 16:57:50 发布

阅读量268

点赞数

分类专栏： hdu---解题报告

个人笔记，仅供复习

本文链接：https://blog.youkuaiyun.com/weixin_42373330/article/details/81458911

版权

这篇博客探讨了在计算机科学中常见的队列数据结构，特别是如何计算以特定模式排列的E-queue的数量。作者通过定义f表示女性，m表示男性，并给出了长度为L的队列可能的2L种组合。当存在fmf或fff子队列时，称为O-queue，反之则是E-queue。题目要求编写程序计算L长度的E-queue数量模M。作者分享了看到解题报告中的图表后得到启发，发现递推公式f(n)=f(n-1)+f(n-3)+f(n-4)，并通过矩阵快速幂的方法解决了问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Queuing

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4638 Accepted Submission(s): 2045

Problem Description

Queues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our daily life. There are many people lined up at the lunch time.

Now we define that ‘f’ is short for female and ‘m’ is short for male. If the queue’s length is L, then there are 2Lnumbers of queues. For example, if L = 2, then they are ff, mm, fm, mf . If there exists a subqueue as fmf or fff, we call it O-queue else it is a E-queue.
Your task is to calculate the number of E-queues mod M with length L by writing a program.

Input

Inpu

最低0.47元/天解锁文章