<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Luwhere的博客]]></title><description><![CDATA[ACM菜鸟起飞之路。]]></description><link>https://blog.youkuaiyun.com/Luwhere</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Luwhere]]></copyright><item><title><![CDATA[线段树lazytag标记]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/78983174</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/78983174</guid><author>Luwhere</author><pubDate>Fri, 05 Jan 2018 16:57:10 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define ll long long 
const int maxn=100005;
ll tree[maxn*4];
int a[maxn];
ll tag[maxn*4];
void build(int rt,int l,i]]></description><category></category></item><item><title><![CDATA[高精度运算]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/73565198</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/73565198</guid><author>Luwhere</author><pubDate>Thu, 22 Jun 2017 11:06:56 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
typedef long long int64;
const int B = 1000000000;
const int L = 9;
inline int intcmp(int a, int b)
{
    if (a > b)
        retu]]></description><category></category></item><item><title><![CDATA[数据的离散化]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/50759721</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/50759721</guid><author>Luwhere</author><pubDate>Sun, 28 Feb 2016 13:27:01 +0800</pubDate><description><![CDATA[有些数据本身很大， 自身无法作为数组的下标保存对应的属性。

如果这时只是需要这堆数据的相对属性， 那么可以对其进行离散化处理！

离散化：当数据只与它们之间的相对大小有关，而与具体是多少无关时，可以进行离散化。


例如

9 1 0 5 4 与 5 2 1 4 3 的逆序对个数相同。
设有4个数：
1234567、123456789、12345678、123456
排序]]></description><category></category></item><item><title><![CDATA[Vitaliy and Pie]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/50759050</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/50759050</guid><author>Luwhere</author><pubDate>Sun, 28 Feb 2016 10:34:43 +0800</pubDate><description><![CDATA[Vitaliy and Pie
Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d
 & %I64u
Submit Status




Description

After a hard day Vitaly got very hungry and he wants to eat his ]]></description><category></category></item><item><title><![CDATA[Ilya and Sticks]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/50759047</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/50759047</guid><author>Luwhere</author><pubDate>Sun, 28 Feb 2016 10:33:40 +0800</pubDate><description><![CDATA[Ilya and Sticks
Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d
 & %I64u
Submit Status




Description

In the evening, after the contest Ilya was bored, and he really ]]></description><category></category></item><item><title><![CDATA[Points in Segments (II)(线段树）]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/50759034</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/50759034</guid><author>Luwhere</author><pubDate>Sun, 28 Feb 2016 10:31:55 +0800</pubDate><description><![CDATA[Points in Segments (II)
Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu
Submit Status



Description

Given n segments (1 dimensional) and q points, for each point y]]></description><category></category></item><item><title><![CDATA[UVA12563 - Jin Ge Jin Qu hao(01背包）]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/50759011</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/50759011</guid><author>Luwhere</author><pubDate>Sun, 28 Feb 2016 10:27:50 +0800</pubDate><description><![CDATA[(If you smiled when you see the title, this problem is for you ^_^)
For those who don’t know KTV, see: http://en.wikipedia.org/wiki/Karaoke_box
There is one very popular song called Jin Ge Jin Qu().]]></description><category></category></item><item><title><![CDATA[hdu 2112(dijkstra)]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/50751925</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/50751925</guid><author>Luwhere</author><pubDate>Fri, 26 Feb 2016 18:41:42 +0800</pubDate><description><![CDATA[HDU Today
Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 22106    Accepted Submission(s): 5300


Problem Description
经过锦囊相助，海东集团终于度过了危机]]></description><category></category></item><item><title><![CDATA[hdu 1501 Zipper(DFS)]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/50739853</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/50739853</guid><author>Luwhere</author><pubDate>Thu, 25 Feb 2016 18:56:38 +0800</pubDate><description><![CDATA[Zipper
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8638    Accepted Submission(s): 3058



Problem Description

Given three strings]]></description><category></category></item><item><title><![CDATA[C-free重装]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/50217167</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/50217167</guid><author>Luwhere</author><pubDate>Tue, 08 Dec 2015 12:37:55 +0800</pubDate><description><![CDATA[1、使用自带的程序删除，并删除该安装文件夹下所有文件。

2、在C:\Users\Administrator\Documents中找到C-FREE目录，全部删除。

3、C:\Users\Administrator\AppData\Roaming中找到C-FREE目录，全部删除。

4、在注册表(regedit)中找到HKEY_CURRENT_USER-Software-C-free目]]></description><category></category></item><item><title><![CDATA[zjnu 1462 - 舞会 (dijkstra) 解题报告]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/50165607</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/50165607</guid><author>Luwhere</author><pubDate>Thu, 03 Dec 2015 20:12:40 +0800</pubDate><description><![CDATA[舞会

Case Time Limit:1000MS



Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 50
 
Accepted: 26





Description

Longpo想要去参加long1的舞会，但是longpo和long1隔了几个村子。村子与村子间可能有]]></description><category></category></item><item><title><![CDATA[zjnu 1414 最小生成树Kruskal算法 - （kruscal 算法)解题报告]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/50164627</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/50164627</guid><author>Luwhere</author><pubDate>Thu, 03 Dec 2015 18:29:18 +0800</pubDate><description><![CDATA[最小生成树Kruskal算法




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 112
 
Accepted: 61





Description

某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了连接两个城镇需要花费的代价。省政府“畅通工程”的目标是使全省任何两]]></description><category></category></item><item><title><![CDATA[zjnu 1450 - 迷宫（BFS）解题报告]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/50161963</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/50161963</guid><author>Luwhere</author><pubDate>Thu, 03 Dec 2015 15:54:21 +0800</pubDate><description><![CDATA[迷宫

Case Time Limit:1000MS



Time Limit: 10000MS
 
Memory Limit: 65536K


Total Submissions: 48
 
Accepted: 23




Description

小C最近在研究机器人，他想看看自己的机器人够不够智能，于是他将机器人放在一个n*m的迷宫中，看看机器人]]></description><category></category></item><item><title><![CDATA[杭电题目分类]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/49886147</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/49886147</guid><author>Luwhere</author><pubDate>Tue, 17 Nov 2015 13:07:31 +0800</pubDate><description><![CDATA[第一篇    


1001 这个就不用说了吧
1002 简单的大数
1003 DP经典问题，最大连续子段和
1004 简单题
1005 找规律（循环点）
1006 感觉有点BT的题，我到现在还没过
1007 经典问题，最近点对问题，用分治
1008 简单题
1009 贪心
1010 搜索题，剪枝很关键
1011 
1012 简单题
1013 简单题（有个小陷阱）
]]></description><category></category></item><item><title><![CDATA[N的M次方大数模板]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/49585533</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/49585533</guid><author>Luwhere</author><pubDate>Mon, 02 Nov 2015 13:51:06 +0800</pubDate><description><![CDATA[#include
#include

void reverseOrder(char* str, int p, int q)
{
    char temp;
    while(p < q)
    {
        temp = str[p];
        str[p] = str[q];
        str[q] = temp;
        p++;
        q--;
 ]]></description><category></category></item><item><title><![CDATA[hdu 1106 - 排序（解题报告）]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/48155061</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/48155061</guid><author>Luwhere</author><pubDate>Tue, 01 Sep 2015 10:55:39 +0800</pubDate><description><![CDATA[排序
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 42864    Accepted Submission(s): 12305



Problem Description

输入一行数字，如果我们把这行数字中的‘5’]]></description><category></category></item><item><title><![CDATA[Codeforces 130A - Testing Pants for Sadness(解题报告）]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/47687119</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/47687119</guid><author>Luwhere</author><pubDate>Sat, 15 Aug 2015 22:29:06 +0800</pubDate><description><![CDATA[Testing Pants for SadnessCrawling in process...
Crawling failed
Time Limit:2000MS    
Memory Limit:262144KB     
64bit IO Format:%I64d & %I64u 
Submit

Status 
Practice 
CodeForces 103A 

]]></description><category></category></item><item><title><![CDATA[hdu 1071 - The area(解题报告）]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/47687055</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/47687055</guid><author>Luwhere</author><pubDate>Sat, 15 Aug 2015 22:25:02 +0800</pubDate><description><![CDATA[The area
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8715    Accepted Submission(s): 6115


Problem Description
Ignatius bought a lan]]></description><category></category></item><item><title><![CDATA[ACdream 1203 - KIDx's Triangle(解题报告）]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/47687013</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/47687013</guid><author>Luwhere</author><pubDate>Sat, 15 Aug 2015 22:21:23 +0800</pubDate><description><![CDATA[KIDx's Triangle
Time Limit: 2000/1000MS (Java/Others)
Memory Limit: 128000/64000KB (Java/Others)
Submit

Statistic 
Next Problem
Problem Description

One day, KIDx solved a math problem for m]]></description><category></category></item><item><title><![CDATA[hdu 5120 - Intersection(解题报告）]]></title><link>https://blog.youkuaiyun.com/Luwhere/article/details/47686939</link><guid>https://blog.youkuaiyun.com/Luwhere/article/details/47686939</guid><author>Luwhere</author><pubDate>Sat, 15 Aug 2015 22:18:20 +0800</pubDate><description><![CDATA[Intersection
Time Limit: 4000/4000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)
Total Submission(s): 1036    Accepted Submission(s): 407


Problem Description
Matt is a big fa]]></description><category></category></item></channel></rss>