<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Erics' code room]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/bojack_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; bojack_]]></copyright><item><title><![CDATA[Python的第一个程序]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/83347220</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/83347220</guid><author>bojack_</author><pubDate>Thu, 25 Oct 2018 00:32:55 +0800</pubDate><description><![CDATA[python出现的问题pip安装request &amp;amp;amp;&amp;amp;amp;beautifulsoup获取网页源码登录问题获取源码后的处理ajax异步？原来是js源码
出现的问题
学长布置的任务
把学校本科生院的课表爬下来
也不能叫爬虫因为他也不会爬只会访问那一个网页
就叫他爪子吧
中间碰到许多坑
现在填一下（然后又挖坑）
pip安装request &amp;amp;amp;&amp;amp;amp;beautifulsoup
一开始下...]]></description><category></category></item><item><title><![CDATA[数论&&快排&&dp板子]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/78485058</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/78485058</guid><author>bojack_</author><pubDate>Thu, 09 Nov 2017 07:19:20 +0800</pubDate><description><![CDATA[板子日DAY2]]></description><category></category></item><item><title><![CDATA[数据结构&&图论板子]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/78476891</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/78476891</guid><author>bojack_</author><pubDate>Wed, 08 Nov 2017 11:40:37 +0800</pubDate><description><![CDATA[板子日DAY1]]></description><category></category></item><item><title><![CDATA[NOIP2016 DAY2]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/78335352</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/78335352</guid><author>bojack_</author><pubDate>Tue, 24 Oct 2017 22:00:15 +0800</pubDate><description><![CDATA[NOIP2016day2]]></description><category></category></item><item><title><![CDATA[欧拉筛法 && 欧拉函数]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/78313778</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/78313778</guid><author>bojack_</author><pubDate>Sun, 22 Oct 2017 21:58:56 +0800</pubDate><description><![CDATA[筛法&&欧拉函数]]></description><category></category></item><item><title><![CDATA[树链剖分初步]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/78312521</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/78312521</guid><author>bojack_</author><pubDate>Sun, 22 Oct 2017 19:51:28 +0800</pubDate><description><![CDATA[树链剖分]]></description><category></category></item><item><title><![CDATA[关于树状数组的一些讨论]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/78308885</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/78308885</guid><author>bojack_</author><pubDate>Sun, 22 Oct 2017 11:26:49 +0800</pubDate><description><![CDATA[树状数组]]></description><category></category></item><item><title><![CDATA[独木桥 解题报告]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/78308312</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/78308312</guid><author>bojack_</author><pubDate>Sun, 22 Oct 2017 10:11:07 +0800</pubDate><description><![CDATA[构造]]></description><category></category></item><item><title><![CDATA[银河英雄传说 解题报告]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/78308234</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/78308234</guid><author>bojack_</author><pubDate>Sun, 22 Oct 2017 09:55:51 +0800</pubDate><description><![CDATA[带权并查集]]></description><category></category></item><item><title><![CDATA[Tarjan LCA]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/78307919</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/78307919</guid><author>bojack_</author><pubDate>Sun, 22 Oct 2017 08:27:50 +0800</pubDate><description><![CDATA[LCA的Tarjan算法]]></description><category></category></item><item><title><![CDATA[Tarjan 缩点]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/78307461</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/78307461</guid><author>bojack_</author><pubDate>Sat, 21 Oct 2017 23:40:53 +0800</pubDate><description><![CDATA[Tarjan 缩点]]></description><category></category></item><item><title><![CDATA[LIS 最长严格上升子序列问题]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/72742626</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/72742626</guid><author>bojack_</author><pubDate>Thu, 25 May 2017 19:41:21 +0800</pubDate><description><![CDATA[复习系列]]></description><category></category></item><item><title><![CDATA[食物链]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/72036842</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/72036842</guid><author>bojack_</author><pubDate>Sun, 14 May 2017 18:49:41 +0800</pubDate><description><![CDATA[瞻仰了很久的一道题并查集名题被赵大哥骂为水题/捂脸那我们来看一看这个水题首先题目描述（1）里说 当前的话与前面的某些真的话冲突，就是假话； 
那么意思也就是 当前的话只要和前面的没有冲突，那么就是真话；那我们可以每读进一句话先判断和以前有没有冲突，如果没有就记录下来，否则ans++;题目说对于a,b有三种关系，a吃b，a被b吃，a b同类那么（在赵大哥的指点下）就有了思路创建一个f[3*n]的数组]]></description><category></category></item><item><title><![CDATA[关于一个水题]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/68490271</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/68490271</guid><author>bojack_</author><pubDate>Thu, 30 Mar 2017 17:12:32 +0800</pubDate><description><![CDATA[有一个水题大概是 
给你一个数n 
和一串小写字母把小写字母右移n位 
超过z就从a开始最后输出挺水的吧然而char zy(char a)
{
    a+=n;
    if(a>'z')
    {
        a-=26;
    }
    return a;
}一开始小学弟是这么写的但是最后乱码找了半天错也没找出来刚刚查了ASCII码表然后做了实验char 类型的范围只是-128~12]]></description><category></category></item><item><title><![CDATA[线段树lazy标记入门笔记]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/64443134</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/64443134</guid><author>bojack_</author><pubDate>Tue, 21 Mar 2017 15:57:44 +0800</pubDate><description><![CDATA[最近花近两个星期敲线（da）段（you）树（xi）。其实花了一节课磕磕巴巴就打出来了然而总是不过，然后开始漫长的找错征途。。。 
此处省略一万行泪； 
还好有题解和磊磊不然一年都找不出来错/捂脸





此处正文

codevs4919 
线段树练习4

给你N个数，有两种操作

1：给区间[a,b]内的所有数都增加X

2：询问区间[a,b]能被7整除的个数

区间修改区间查询

结构体里添加]]></description><category></category></item><item><title><![CDATA[codevs1166矩阵取数游戏]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/53013212</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/53013212</guid><author>bojack_</author><pubDate>Wed, 02 Nov 2016 21:48:57 +0800</pubDate><description><![CDATA[区间型DP；]]></description><category></category></item><item><title><![CDATA[双向广搜  八数码]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/52996399</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/52996399</guid><author>bojack_</author><pubDate>Tue, 01 Nov 2016 15:29:28 +0800</pubDate><description><![CDATA[双向广搜还是一个很神奇的东西//判重更神奇；双广仅适用于有目标状态的题目；#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<map>
#include<]]></description><category></category></item><item><title><![CDATA[codevs  1002 搭桥]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/52927715</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/52927715</guid><author>bojack_</author><pubDate>Tue, 25 Oct 2016 21:54:57 +0800</pubDate><description><![CDATA[kruskal+最小生成树]]></description><category></category></item><item><title><![CDATA[1036商务旅行]]></title><link>https://blog.youkuaiyun.com/bojack_/article/details/52889959</link><guid>https://blog.youkuaiyun.com/bojack_/article/details/52889959</guid><author>bojack_</author><pubDate>Sat, 22 Oct 2016 08:07:26 +0800</pubDate><description><![CDATA[1036 商务旅行 
 时间限制: 1 s 
 空间限制: 128000 KB 
 题目等级 : 钻石 Diamond 
题解 
 查看运行结果 
题目描述 Description 
某首都城市的商人要经常到各城镇去做生意，他们按自己的路线去做，目的是为了更好的节约时间。假设有N个城镇，首都编号为1，商人从首都出发，其他各城镇之间都有道路连接，任意两个城镇之间如果有直连道路，在他们之间行驶需要花费单]]></description><category></category></item></channel></rss>