<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_56095461的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_56095461</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_56095461]]></copyright><item><title><![CDATA[牛客小白月赛34：A dd爱科学1.0]]></title><link>https://blog.youkuaiyun.com/m0_56095461/article/details/117390740</link><guid>https://blog.youkuaiyun.com/m0_56095461/article/details/117390740</guid><author>m0_56095461</author><pubDate>Sat, 29 May 2021 20:52:45 +0800</pubDate><description><![CDATA[链接：https://ac.nowcoder.com/acm/contest/11211/A
来源：牛客网


题目描述

大科学家dddddd最近在研究转基因白菜，白菜的基因序列由一串大写英文字母构成，dddddd经过严谨的推理证明发现，只有当白菜的基因序列呈按位非递减形式时，这株白菜的高附加值将达到最高，于是优秀的dddddd开始着手修改白菜的基因序列，dddddd每次修改基因序列的任意位需要的代价是111，dddddd想知道，修改白菜的基因序列使其高附加值达到最高，所需要的最小代价的是多少。

输入.]]></description><category></category></item><item><title><![CDATA[补题（2019CCPC江西省赛）]]></title><link>https://blog.youkuaiyun.com/m0_56095461/article/details/117187682</link><guid>https://blog.youkuaiyun.com/m0_56095461/article/details/117187682</guid><author>m0_56095461</author><pubDate>Sun, 23 May 2021 10:29:37 +0800</pubDate><description><![CDATA[G - Traffic


  Avin is observing the cars at a crossroads. He finds that there are n cars running in the east-west direction with the i-th car passing the intersection at time ai . There are another m cars running in the north-south direction with the i..]]></description><category></category></item></channel></rss>