<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[NOIP提高组日志]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/hssl_ywl</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hssl_ywl]]></copyright><item><title><![CDATA[http://ybt.ssoier.cn:8088/]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/102669156</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/102669156</guid><author>hssl_ywl</author><pubDate>Mon, 21 Oct 2019 18:19:42 +0800</pubDate><description><![CDATA[http://ybt.ssoier.cn:8088/

]]></description><category></category></item><item><title><![CDATA[ghjtrjh]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/101379624</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/101379624</guid><author>hssl_ywl</author><pubDate>Wed, 25 Sep 2019 18:33:52 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
const int MN=2005,inf=1000000000;
int n,u,vv,p[MN],nex[MN],v[MN],ec;
struct node{
int x,y,z;
}a[MN];
inline bool operat...]]></description><category></category></item><item><title><![CDATA[P1039 侦探推理]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/101377862</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/101377862</guid><author>hssl_ywl</author><pubDate>Wed, 25 Sep 2019 18:02:52 +0800</pubDate><description><![CDATA[https://www.luogu.org/problemnew/show/P1039
#include&lt;iostream&gt; 
#include&lt;cstring&gt;
#include&lt;string&gt;
using namespace std;
int n,m,p,fake[21],err,w[200],nx;
string name[100],say[200];
s...]]></description><category></category></item><item><title><![CDATA[P3853 [TJOI2007]路标设置]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/101377826</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/101377826</guid><author>hssl_ywl</author><pubDate>Wed, 25 Sep 2019 18:02:26 +0800</pubDate><description><![CDATA[https://www.luogu.org/problemnew/show/P3853
1.用二分法慢慢寻找最小的“空旷指数”，假设目前的mid是一个最小的“空旷指数”,那么在a数组（路标数组）里每两个相邻间的路标距离一定要小于等于目前的mid， 如果大于，那就必须使用一些路标去填补这个距离。
2.那么怎么去补呢？由于目前mid已是最大距离，填补时两路标距离一定&lt;=mid，那么当然用mid啦...]]></description><category></category></item><item><title><![CDATA[连续自然数平方和]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/101235657</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/101235657</guid><author>hssl_ywl</author><pubDate>Mon, 23 Sep 2019 23:48:31 +0800</pubDate><description><![CDATA[#22. 连续自然数平方和
描述
提交
自定义测试

【题目描述】：
给你一个数X，询问有多少种连续自然数的平方和等于这个数，按照起始自然数由小到大的顺序，输出所有可能。
【输入描述】：
输入有多组，每组一行，一个数X
【输出描述】：
对于每组数据，输出多行；
第一行，一个数表示有多少种可能；
以下每行输出一种：第一个数A是连续多少个自然数，后面输出这些连续自然数。
【样例输入】
2030
681...]]></description><category></category></item><item><title><![CDATA[最长无重复字符子串]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/101235118</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/101235118</guid><author>hssl_ywl</author><pubDate>Mon, 23 Sep 2019 23:40:55 +0800</pubDate><description><![CDATA[#79. 最长无重复字符子串
描述
提交
自定义测试

【题目描述】：
给定一个长度为N的整数无序序列{a1,a2,…,ai,…,an}，0&lt;=ai&lt;=100,000。找到连续的没有重复数字的最长子序列，并输出它的长度。例如：
{1 2 3 1 2 3 1 2 3 3 3}最长的没有重复数字的子序列是{1 2 3}，长度是3。
{2 2 2 2 2 2} 最长的没有重复数字的子序列是{...]]></description><category></category></item><item><title><![CDATA[#281. 排队布局]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/101156948</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/101156948</guid><author>hssl_ywl</author><pubDate>Sun, 22 Sep 2019 14:14:33 +0800</pubDate><description><![CDATA[#281. 排队布局
描述
提交
自定义测试
1
2
3
【题目描述】：
当排队等候喂食时，奶牛喜欢和它们的朋友靠近些。FJ 有N头奶牛，编号从1到N，沿一条直线站着等候喂食。奶牛排在队伍中的顺序和它们的编号是相同的。因为奶牛相当苗条，所以可能有两头或者更多奶牛站在同一位置上。如果我们想象奶牛是站在一条数轴上的话，允许有两头或更多奶牛拥有相同的横坐标。一些奶牛相互间存有好感，它们希望两者之间的距离...]]></description><category></category></item><item><title><![CDATA[P1690 贪婪的Copy]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/101156853</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/101156853</guid><author>hssl_ywl</author><pubDate>Sun, 22 Sep 2019 14:12:05 +0800</pubDate><description><![CDATA[https://www.luogu.org/problem/P1690
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;stack&gt;
using namespace ...]]></description><category></category></item><item><title><![CDATA[最小花费]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/101083121</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/101083121</guid><author>hssl_ywl</author><pubDate>Fri, 20 Sep 2019 23:14:49 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
#define DU double
using namespace std;
const int MN=...]]></description><category></category></item><item><title><![CDATA[组合三角形]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/101083109</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/101083109</guid><author>hssl_ywl</author><pubDate>Fri, 20 Sep 2019 23:14:05 +0800</pubDate><description><![CDATA[http://220.180.209.150:38888/problem/30
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstdlib&gt;
#include &lt;cmath&gt;
#include &lt;cstring&gt;
#include &lt;algorithm&gt;
using name...]]></description><category></category></item><item><title><![CDATA[表达式的值]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/101040088</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/101040088</guid><author>hssl_ywl</author><pubDate>Thu, 19 Sep 2019 23:29:11 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;string&gt;
#include &lt;stack&gt;
using namespace std;
struct dp {
  int zero,one;
}ans[150001];
int len,t = 1;
const int mod = 10007;
string str;
stack&lt;char&...]]></description><category></category></item><item><title><![CDATA[dijkstra+堆 模板]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/101039199</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/101039199</guid><author>hssl_ywl</author><pubDate>Thu, 19 Sep 2019 22:43:50 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
#define DU double
using namespace std;
const int MN=...]]></description><category></category></item><item><title><![CDATA[友好城市]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/100944196</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/100944196</guid><author>hssl_ywl</author><pubDate>Tue, 17 Sep 2019 23:35:21 +0800</pubDate><description><![CDATA[题目描述
有一条横贯东西的大河，河有笔直的南北两岸，岸上各有位置各不相同的N个城市。北岸的每个城市有且仅有一个友好城市在南岸，而且不同城市的友好城市不相同。每对友好城市都向政府申请在河上开辟一条直线航道连接两个城市，但是由于河上雾太大，政府决定避免任意两条航道交叉，以避免事故。编程帮助政府做出一些批准和拒绝申请的决定，使得在保证任意两条航道不相交的情况下，被批准的申请尽量多。
输入输出格式
输入格...]]></description><category></category></item><item><title><![CDATA[黑匣子]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/100944172</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/100944172</guid><author>hssl_ywl</author><pubDate>Tue, 17 Sep 2019 23:34:28 +0800</pubDate><description><![CDATA[题目描述
Black Box是一种原始的数据库。它可以储存一个整数数组，还有一个特别的变量i。最开始的时候Black Box是空的．而i等于0。这个Black Box要处理一串命令。
命令只有两种：
ADD(x):把x元素放进BlackBox;
GET:i加1，然后输出Blackhox中第i小的数。
记住：第i小的数，就是Black Box里的数的按从小到大的顺序排序后的第i个元素。例如：
我们来...]]></description><category></category></item><item><title><![CDATA[P1491 集合位置]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/100906121</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/100906121</guid><author>hssl_ywl</author><pubDate>Mon, 16 Sep 2019 23:39:29 +0800</pubDate><description><![CDATA[https://www.luogu.org/problem/P1491
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
#define DU doubl...]]></description><category></category></item><item><title><![CDATA[P1629 邮递员送信]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/100866993</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/100866993</guid><author>hssl_ywl</author><pubDate>Sun, 15 Sep 2019 22:46:30 +0800</pubDate><description><![CDATA[https://www.luogu.org/problem/P1629
#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstdlib&gt;
#include&lt;algorithm&gt;
#include&lt;cmath&gt;
#include&lt;cstring&gt;
#define INF (1&lt;&l...]]></description><category></category></item><item><title><![CDATA[P1194 买礼物]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/100847478</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/100847478</guid><author>hssl_ywl</author><pubDate>Sun, 15 Sep 2019 09:26:26 +0800</pubDate><description><![CDATA[https://www.luogu.org/problem/P1194
#include &lt;algorithm&gt;
#include &lt;iostream&gt;
#include &lt;cstring&gt;
#include &lt;cstdio&gt;
#include &lt;queue&gt;
#include &lt;stack&gt;
#include &lt;cma...]]></description><category></category></item><item><title><![CDATA[P1197 [JSOI2008]星球大战]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/100847463</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/100847463</guid><author>hssl_ywl</author><pubDate>Sun, 15 Sep 2019 09:25:35 +0800</pubDate><description><![CDATA[https://www.luogu.org/problem/P1197
#include &lt;algorithm&gt;
#include &lt;iostream&gt;
#include &lt;cstring&gt;
#include &lt;cstdio&gt;
#include &lt;queue&gt;
#include &lt;stack&gt;
#include &lt;cma...]]></description><category></category></item><item><title><![CDATA[P1991 无线通讯网]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/100839687</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/100839687</guid><author>hssl_ywl</author><pubDate>Sun, 15 Sep 2019 00:00:01 +0800</pubDate><description><![CDATA[https://www.luogu.org/problem/P1991
#include &lt;algorithm&gt;
#include &lt;iostream&gt;
#include &lt;cstring&gt;
#include &lt;cstdio&gt;
#include &lt;cmath&gt;
using namespace std;

const int MN=1000...]]></description><category></category></item><item><title><![CDATA[P1272 重建道路]]></title><link>https://blog.youkuaiyun.com/hssl_ywl/article/details/100839664</link><guid>https://blog.youkuaiyun.com/hssl_ywl/article/details/100839664</guid><author>hssl_ywl</author><pubDate>Sat, 14 Sep 2019 23:59:08 +0800</pubDate><description><![CDATA[https://www.luogu.org/problem/P1272
#include
#include
#include
using namespace std;
#define MAXN 150
int N,P;
vectorG[MAXN+5];
int son[MAXN+5],sum[MAXN+5];
//son:the num of i’s son     sum:the num of ...]]></description><category></category></item></channel></rss>