<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[value0的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/value0</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; value0]]></copyright><item><title><![CDATA[7-13 首都选址 分数 10]]></title><link>https://blog.youkuaiyun.com/value0/article/details/128076319</link><guid>https://blog.youkuaiyun.com/value0/article/details/128076319</guid><author>value0</author><pubDate>Mon, 28 Nov 2022 11:25:30 +0800</pubDate><description><![CDATA[PTA 7-13 首都选址]]></description><category></category></item><item><title><![CDATA[第十三届蓝桥杯大赛C++B组：修剪灌木]]></title><link>https://blog.youkuaiyun.com/value0/article/details/124070769</link><guid>https://blog.youkuaiyun.com/value0/article/details/124070769</guid><author>value0</author><pubDate>Sat, 09 Apr 2022 23:50:06 +0800</pubDate><description><![CDATA[第十三届蓝桥杯大赛C++B组：修剪灌木

只会暴力。
为了保险，来回跑了三遍。
来回三遍和四遍结果一样的，大概都跑出来了。
#include&lt;bits/stdc++.h&gt;
using namespace std;
const int N=10010;
int h[N];
int mh[N];
int num=1;
int n;

int main()
{
	cin&gt;&gt;n;
	for(int i=1;i&lt;=n;i++)
	{
		for(int j=1;j&lt;=n;j++)
]]></description><category></category></item><item><title><![CDATA[蓝桥杯第十三届省赛C++B组题:X进制减法]]></title><link>https://blog.youkuaiyun.com/value0/article/details/124070598</link><guid>https://blog.youkuaiyun.com/value0/article/details/124070598</guid><author>value0</author><pubDate>Sat, 09 Apr 2022 23:39:46 +0800</pubDate><description><![CDATA[蓝桥杯第十三届省赛C++B组题:X进制减法]]></description><category></category></item></channel></rss>