<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[demiphea的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/demiphea</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; demiphea]]></copyright><item><title><![CDATA[线性表【数据结构】_Java]]></title><link>https://blog.csdn.net/demiphea/article/details/125165529</link><guid>https://blog.csdn.net/demiphea/article/details/125165529</guid><author>demiphea</author><pubDate>Tue, 07 Jun 2022 15:08:46 +0800</pubDate><description><![CDATA[Java_实现数据结构链表]]></description><category></category></item><item><title><![CDATA[R（C语言）]]></title><link>https://blog.csdn.net/demiphea/article/details/122829086</link><guid>https://blog.csdn.net/demiphea/article/details/122829086</guid><author>demiphea</author><pubDate>Tue, 08 Feb 2022 18:28:30 +0800</pubDate><description><![CDATA[小红拿到了一个长度为 n的字符串，该字符串仅由大写字母组成。小红很喜欢红色（用'R'字母表示），但她非常讨厌紫色（用'P'字母表示）。她想取一个连续子串，该子串包含至少 k个'R'字符，且不能包含'P'字符。你能告诉她有多少合法的方案可以取到吗？
注：只要连续子串的起始位置或终止位置不同，我们就认为是两个不同的方案。

输入描述:


第一行输入两个正整数 n 和 k ，用空格隔开。
输入一行字符串，该字符串保证仅包含大写字母（'A'到'Z'）。
数据范围：
1≤n≤200000
1≤k≤20

输出描述.]]></description><category></category></item><item><title><![CDATA[HDU-2006【求奇数的乘积】]]></title><link>https://blog.csdn.net/demiphea/article/details/121580548</link><guid>https://blog.csdn.net/demiphea/article/details/121580548</guid><author>demiphea</author><pubDate>Sat, 27 Nov 2021 17:36:02 +0800</pubDate><description><![CDATA[HDUOJ-2006]]></description><category></category></item><item><title><![CDATA[HDU-2005【第几天？】]]></title><link>https://blog.csdn.net/demiphea/article/details/121580242</link><guid>https://blog.csdn.net/demiphea/article/details/121580242</guid><author>demiphea</author><pubDate>Sat, 27 Nov 2021 17:27:40 +0800</pubDate><description><![CDATA[HDUOJ-2005]]></description><category></category></item><item><title><![CDATA[HDU-2004【成绩转换】]]></title><link>https://blog.csdn.net/demiphea/article/details/121580106</link><guid>https://blog.csdn.net/demiphea/article/details/121580106</guid><author>demiphea</author><pubDate>Sat, 27 Nov 2021 17:12:59 +0800</pubDate><description><![CDATA[HDUOJ-2004]]></description><category></category></item><item><title><![CDATA[HDU-2003【求绝对值】]]></title><link>https://blog.csdn.net/demiphea/article/details/121579903</link><guid>https://blog.csdn.net/demiphea/article/details/121579903</guid><author>demiphea</author><pubDate>Sat, 27 Nov 2021 17:07:09 +0800</pubDate><description><![CDATA[HDUOJ-2003]]></description><category></category></item><item><title><![CDATA[HDU-2002【计算球体积】]]></title><link>https://blog.csdn.net/demiphea/article/details/121578241</link><guid>https://blog.csdn.net/demiphea/article/details/121578241</guid><author>demiphea</author><pubDate>Sat, 27 Nov 2021 15:47:22 +0800</pubDate><description><![CDATA[HDUOJ-2002]]></description><category></category></item><item><title><![CDATA[HDU-2001【计算两点间的距离】]]></title><link>https://blog.csdn.net/demiphea/article/details/121577068</link><guid>https://blog.csdn.net/demiphea/article/details/121577068</guid><author>demiphea</author><pubDate>Sat, 27 Nov 2021 15:24:39 +0800</pubDate><description><![CDATA[HDUOJ-2001]]></description><category></category></item><item><title><![CDATA[HDU-2000【ASCII码排序】]]></title><link>https://blog.csdn.net/demiphea/article/details/121575399</link><guid>https://blog.csdn.net/demiphea/article/details/121575399</guid><author>demiphea</author><pubDate>Sat, 27 Nov 2021 12:55:54 +0800</pubDate><description><![CDATA[HDUOJ-2000]]></description><category></category></item></channel></rss>