<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[xiaotuji的博客]]></title><description><![CDATA[总要留下些足迹，证明我曾奋斗过]]></description><link>https://blog.youkuaiyun.com/NEET_Champloo</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; NEET_Champloo]]></copyright><item><title><![CDATA[HDU - 1024 Max Sum Plus Plus(dp求最大m子段和)]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/80186680</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/80186680</guid><author>NEET_Champloo</author><pubDate>Thu, 03 May 2018 21:12:22 +0800</pubDate><description><![CDATA[Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34600    Accepted Submission(s): 12359Problem DescriptionNow I think you have g...]]></description><category></category></item><item><title><![CDATA[HDU - 1016 Prime Ring Problem（dfs，素数环）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78680874</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78680874</guid><author>NEET_Champloo</author><pubDate>Thu, 30 Nov 2017 20:58:41 +0800</pubDate><description><![CDATA[Prime Ring Problem
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 55512    Accepted Submission(s): 24583



Problem Description

A rin]]></description><category></category></item><item><title><![CDATA[HDU - 1042 N!(高精度BigInt)]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78653186</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78653186</guid><author>NEET_Champloo</author><pubDate>Tue, 28 Nov 2017 11:26:06 +0800</pubDate><description><![CDATA[N!Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 86335    Accepted Submission(s): 25398
Problem DescriptionGiven an integer N(0 ≤ N ≤ 100]]></description><category></category></item><item><title><![CDATA[HDU - 1251 统计难题（字典树模板题）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78380403</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78380403</guid><author>NEET_Champloo</author><pubDate>Sat, 28 Oct 2017 22:57:56 +0800</pubDate><description><![CDATA[统计难题
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131070/65535 K (Java/Others)
Total Submission(s): 45711    Accepted Submission(s): 16279



Problem Description

Ignatius最近遇到一个难题,老]]></description><category></category></item><item><title><![CDATA[ACM所有算法]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78378701</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78378701</guid><author>NEET_Champloo</author><pubDate>Sat, 28 Oct 2017 19:57:14 +0800</pubDate><description><![CDATA[转载自：http://blog.sina.com.cn/s/blog_adb6743801019h29.html






ACM 所有算法




数据结构



栈，队列，链表
哈希表，哈希数组
堆，优先队列
双端队列
可并堆
左偏堆
二叉查找树
Treap
伸展树
并查集
集合计数问题
二分图的识别
平衡二叉树
二叉排序树
线段树]]></description><category></category></item><item><title><![CDATA[HDU - 2874 Connections between cities（并查集+LCA）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78348501</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78348501</guid><author>NEET_Champloo</author><pubDate>Thu, 26 Oct 2017 00:45:49 +0800</pubDate><description><![CDATA[Connections between cities

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 9053    Accepted Submission(s): 2183



Problem Descripti]]></description><category></category></item><item><title><![CDATA[HDU - 2586 How far away ？（LCA裸题）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78348488</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78348488</guid><author>NEET_Champloo</author><pubDate>Thu, 26 Oct 2017 00:40:20 +0800</pubDate><description><![CDATA[How far away ？

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 10580    Accepted Submission(s): 3851

 

Problem Description

There are n hou...]]></description><category></category></item><item><title><![CDATA[CF#877 E. Danil and a Part-time Job（DFS序+线段树）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78348448</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78348448</guid><author>NEET_Champloo</author><pubDate>Thu, 26 Oct 2017 00:28:15 +0800</pubDate><description><![CDATA[E. Danil and a Part-time Job


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Danil decided to earn some mon]]></description><category></category></item><item><title><![CDATA[CF#877 B. Nikita and string（思维，暴力）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78348403</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78348403</guid><author>NEET_Champloo</author><pubDate>Thu, 26 Oct 2017 00:16:59 +0800</pubDate><description><![CDATA[B. Nikita and string


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



One day Nikita found the string contai]]></description><category></category></item><item><title><![CDATA[CF#877 A. Alex and broken contest（KMP）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78348389</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78348389</guid><author>NEET_Champloo</author><pubDate>Thu, 26 Oct 2017 00:12:10 +0800</pubDate><description><![CDATA[A. Alex and broken contest


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



One day Alex was creating a cont]]></description><category></category></item><item><title><![CDATA[C++ string 字符串查找匹配]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78333033</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78333033</guid><author>NEET_Champloo</author><pubDate>Tue, 24 Oct 2017 18:51:35 +0800</pubDate><description><![CDATA[在写C++程序中，总会遇到要从一个字符串中查找一小段子字符串的情况，对于在C中，我们经常用到strstr()或者strchr()这两种方法。而对于C++的string，我们往往会用到find()。

C++:#inlcude
C: #include

find()：在一个字符串中查找一个指定的单个字符或字符数组。如果找到，就返回首次匹配的开始位置；如果没有查找到匹配的内容，就返回stri]]></description><category></category></item><item><title><![CDATA[BZOJ - 1036 树的统计Count（线段树树链剖分裸题）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78296881</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78296881</guid><author>NEET_Champloo</author><pubDate>Fri, 20 Oct 2017 16:29:50 +0800</pubDate><description><![CDATA[1036: [ZJOI2008]树的统计Count
Time Limit: 10 Sec  Memory Limit: 162 MB
Submit: 19039  Solved: 7761
[Submit][Status][Discuss]
Description

　　一棵树上有n个节点，编号分别为1到n，每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成
一些操作： ]]></description><category></category></item><item><title><![CDATA[POJ - 2155 Matrix（二维线段树、区间更新单点查询）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78202325</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78202325</guid><author>NEET_Champloo</author><pubDate>Wed, 11 Oct 2017 12:21:22 +0800</pubDate><description><![CDATA[Matrix




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 29732
 
Accepted: 10863




Description

Given an N*N matrix A, whose elements are either 0 or 1. A[i, j] m]]></description><category></category></item><item><title><![CDATA[HDU - 1823 Luck and Love（二维线段树、单点更新区间最值）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78202285</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78202285</guid><author>NEET_Champloo</author><pubDate>Wed, 11 Oct 2017 12:09:13 +0800</pubDate><description><![CDATA[Luck and Love
Time Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7277    Accepted Submission(s): 1902



Problem Description

世界上上最远的距离不是]]></description><category></category></item><item><title><![CDATA[POJ - 3667 Hotel （线段树区间合并裸题）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78083385</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78083385</guid><author>NEET_Champloo</author><pubDate>Mon, 25 Sep 2017 11:28:17 +0800</pubDate><description><![CDATA[Hotel




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 18289
 
Accepted: 7937




Description

The cows are journeying north to Thunder Bay in Canada to gain cultu]]></description><category></category></item><item><title><![CDATA[HDU - 1542 Atlantis（线段树扫描线求矩形面积并）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78083209</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/78083209</guid><author>NEET_Champloo</author><pubDate>Mon, 25 Sep 2017 11:16:19 +0800</pubDate><description><![CDATA[Atlantis
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14316    Accepted Submission(s): 5908



Problem Description

There are severa]]></description><category></category></item><item><title><![CDATA[HDU - 2896 病毒侵袭（AC自动机）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/77986424</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/77986424</guid><author>NEET_Champloo</author><pubDate>Thu, 14 Sep 2017 22:51:42 +0800</pubDate><description><![CDATA[病毒侵袭
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 29850    Accepted Submission(s): 6854



Problem Description

当太阳的光辉逐渐被月亮遮蔽，世界失去了光]]></description><category></category></item><item><title><![CDATA[HDU - 3336 Count the string（KMP+DP）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/77978668</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/77978668</guid><author>NEET_Champloo</author><pubDate>Thu, 14 Sep 2017 12:14:30 +0800</pubDate><description><![CDATA[Count the string
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11320    Accepted Submission(s): 5276



Problem Description

It is we]]></description><category></category></item><item><title><![CDATA[HDU - 4825 Xor Sum（01字典树）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/77970951</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/77970951</guid><author>NEET_Champloo</author><pubDate>Wed, 13 Sep 2017 20:59:12 +0800</pubDate><description><![CDATA[Xor Sum
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others)
Total Submission(s): 2885    Accepted Submission(s): 1253



Problem Description

Zeus 和 Prometheu]]></description><category></category></item><item><title><![CDATA[UVALive - 3942 Remember the Word （dp+字典树）]]></title><link>https://blog.youkuaiyun.com/NEET_Champloo/article/details/77970761</link><guid>https://blog.youkuaiyun.com/NEET_Champloo/article/details/77970761</guid><author>NEET_Champloo</author><pubDate>Wed, 13 Sep 2017 20:55:00 +0800</pubDate><description><![CDATA[题意：给出一个长字符串 s ，再给出 n 个短字符串，问用短字符串构成长字符串 s 有多少种方案；


#include 
#include 
using namespace std;

const int N = 3e5 + 10, Mod = 20071027;
int n, p = 0;
int dp[N];
char s[N], f[101];
struct xx{
    int]]></description><category></category></item></channel></rss>