<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[PTCCTP的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/PTCCTP</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; PTCCTP]]></copyright><item><title><![CDATA[Atcoder arc101 f-Robots and Exits题解]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/167283014</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/167283014</guid><author>PTCCTP</author><pubDate>Thu, 08 Oct 2026 21:52:43 +0800</pubDate><description><![CDATA[本题通过将机器人与出口的相对位置离散化，转化为偏序问题。关键观察：仅需考虑左右最近出口，且非法情况对应于距离关系冲突。按左距升序、右距降序排序后，利用树状数组维护动态规划状态 $dp_i = 1 + \sum_{r_j < r_i} dp_j$，统计合法方案数。代码巧妙运用离散化与线段树优化，体现偏序处理与数据结构结合的精髓，思路极具借鉴价值。]]></description><category></category></item><item><title><![CDATA[CSP2024-J T3小木棍]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/164003703</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/164003703</guid><author>PTCCTP</author><pubDate>Sun, 23 Aug 2026 22:49:10 +0800</pubDate><description><![CDATA[本文分析了火柴棒数字构造问题。通过可行性分析得出所有≥4的数字都能表示，且最小位数可通过(s+6)/7计算。提出贪心策略：从高位开始，依次取满足剩余火柴能构成最少位数的最大数字。同时指出另一种解法是利用尽可能多的8来优化构造。该问题提供了多种解题思路，能有效区分考生层次。附参考代码展示了贪心实现方法。]]></description><category></category></item><item><title><![CDATA[2023牛客暑期多校训练营8 D.Distance on Tree]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/132316737</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/132316737</guid><author>PTCCTP</author><pubDate>Wed, 16 Aug 2023 12:54:23 +0800</pubDate><description><![CDATA[Tag:树形DP]]></description><category></category></item><item><title><![CDATA[2023牛客暑期多校训练营9 B.Semi-Puzzle: Brain Storm]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/132297847</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/132297847</guid><author>PTCCTP</author><pubDate>Tue, 15 Aug 2023 15:32:29 +0800</pubDate><description><![CDATA[Tag：扩欧、数学]]></description><category></category></item><item><title><![CDATA[2023牛客暑期多校训练营9 I.Non-Puzzle: Segment Pair(tag:差分)]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/132282488</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/132282488</guid><author>PTCCTP</author><pubDate>Mon, 14 Aug 2023 19:33:16 +0800</pubDate><description><![CDATA[Tag:差分]]></description><category></category></item><item><title><![CDATA[2023河南萌新联赛第（五）场 K.01BFS]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/132208252</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/132208252</guid><author>PTCCTP</author><pubDate>Thu, 10 Aug 2023 14:34:18 +0800</pubDate><description><![CDATA[Tag:单调栈]]></description><category></category></item><item><title><![CDATA[2023牛客暑期多校训练营7 L.Misaka Mikoto‘s Dynamic KMP Problem(KMP))]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/132165354</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/132165354</guid><author>PTCCTP</author><pubDate>Tue, 08 Aug 2023 14:13:03 +0800</pubDate><description><![CDATA[tag:kmp]]></description><category></category></item><item><title><![CDATA[2023牛客暑期多校训练营7 I-We Love Strings (分块)]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/132164799</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/132164799</guid><author>PTCCTP</author><pubDate>Tue, 08 Aug 2023 13:49:31 +0800</pubDate><description><![CDATA[tag:分块，容斥]]></description><category></category></item><item><title><![CDATA[2023牛客暑期多校训练营6 A-Tree (kruskal重构树))]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/132111402</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/132111402</guid><author>PTCCTP</author><pubDate>Fri, 04 Aug 2023 20:27:56 +0800</pubDate><description><![CDATA[Tag:kruskal重构树、树形DP]]></description><category></category></item><item><title><![CDATA[2023河南萌新联赛第（四）场 L.7是大奖？（数位DP基础）]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/132081090</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/132081090</guid><author>PTCCTP</author><pubDate>Thu, 03 Aug 2023 13:20:59 +0800</pubDate><description><![CDATA[数位DP模板题，经验++。]]></description><category></category></item><item><title><![CDATA[2023牛客暑期多校赛第五场 B.Circle of Mistery]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/132059260</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/132059260</guid><author>PTCCTP</author><pubDate>Wed, 02 Aug 2023 12:53:52 +0800</pubDate><description><![CDATA[由于之后可能会出现更大的负权值，所以我们要将预备列和答案队列维护交换一下使得。我们发现在固定左端点时，环中个数固定的情况下，右端点加入该环，造成贡献为。我们发现有大量重复的计算，考虑使用数据结构优化。，显然的，会构成一个个环，要求至少一个环权值。我们仅对一个符合条件的环进行操作。所以仅当加入右端点后至少还能使得一个元素加入，确定使用的数据结构为带排序的优先队列。想要②类足够多，优先加入权值大的。显然的，为了使逆序数对最少，考虑逆序数对最小的情况，且不在环中的数贡献为。在环中的元素有两类。]]></description><category></category></item><item><title><![CDATA[2023牛客暑期多校第五场 H.Nazrin the Greeeeeedy Mouse]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/132040513</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/132040513</guid><author>PTCCTP</author><pubDate>Tue, 01 Aug 2023 16:51:21 +0800</pubDate><description><![CDATA[注意看题目给出的特殊的数据。]]></description><category></category></item><item><title><![CDATA[2023牛客暑期多校第五场 I.The Yakumo Family]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/132042012</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/132042012</guid><author>PTCCTP</author><pubDate>Tue, 01 Aug 2023 16:27:04 +0800</pubDate><description><![CDATA[将问题分解开来，发现小问题之间的联系，再通过关系快速求解。]]></description><category></category></item><item><title><![CDATA[2023牛客多校第五场 E. Red and Blue and Green]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/132029243</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/132029243</guid><author>PTCCTP</author><pubDate>Tue, 01 Aug 2023 13:43:59 +0800</pubDate><description><![CDATA[10310^3103的数据给了它任性的理由，只要能想到建树和区间的特点，这题就能解决了。]]></description><category></category></item><item><title><![CDATA[“蔚来杯“2022牛客暑期多校训练营10 F.Shannon Switching Game?]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/126444026</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/126444026</guid><author>PTCCTP</author><pubDate>Sun, 21 Aug 2022 14:50:52 +0800</pubDate><description><![CDATA[Tag:博弈论、DFS]]></description><category></category></item><item><title><![CDATA[“蔚来杯“2022牛客暑期多校训练营10 K.You are given a tree...]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/126450508</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/126450508</guid><author>PTCCTP</author><pubDate>Sun, 21 Aug 2022 14:39:16 +0800</pubDate><description><![CDATA[Tag:状压DP，随机化]]></description><category></category></item><item><title><![CDATA[蔚来杯_2022牛客暑期多校训练营（加赛） E.Everyone is bot]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/126444070</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/126444070</guid><author>PTCCTP</author><pubDate>Sat, 20 Aug 2022 20:34:38 +0800</pubDate><description><![CDATA[Tag：博弈]]></description><category></category></item><item><title><![CDATA[“蔚来杯“2022牛客暑期多校训练营10 I.Yet Another FFT Problem?]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/126443782</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/126443782</guid><author>PTCCTP</author><pubDate>Sat, 20 Aug 2022 20:24:45 +0800</pubDate><description><![CDATA[Tag：鸽巢原理，枚举]]></description><category></category></item><item><title><![CDATA[“蔚来杯“2022牛客暑期多校训练营（加赛） G.Good red-string]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/126393887</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/126393887</guid><author>PTCCTP</author><pubDate>Thu, 18 Aug 2022 14:00:59 +0800</pubDate><description><![CDATA[Tag:前后缀，栈]]></description><category></category></item><item><title><![CDATA[“蔚来杯“2022牛客暑期多校训练营（加赛） K.Killer Sajin‘s Matrix]]></title><link>https://blog.youkuaiyun.com/PTCCTP/article/details/126403774</link><guid>https://blog.youkuaiyun.com/PTCCTP/article/details/126403774</guid><author>PTCCTP</author><pubDate>Thu, 18 Aug 2022 13:35:58 +0800</pubDate><description><![CDATA[Tag:构造，贪心]]></description><category></category></item></channel></rss>