<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[AC_hunter的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/AC_hunter</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; AC_hunter]]></copyright><item><title><![CDATA[HDU 6184 Counting Stars 三元环计数]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/90667927</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/90667927</guid><author>AC_hunter</author><pubDate>Wed, 29 May 2019 11:57:54 +0800</pubDate><description><![CDATA[Counting Stars

题目意思：

给你一个图，问你有多少个子图是一个四边形加一个对角线。

思路：

枚举对角线，即枚举每一条边，如果存在两个不同的点，和这条边上的两点都相邻的话，这不就是我们所需要的图形吗？

直接开bitset，然后&amp;一下，飞快的过了样例，交上去，飞快的MLE了。

那咋办啊？问大佬去了，大佬直接一句三元环傻逼题，就把我扔走了，，，w(ﾟДﾟ)w

留下了自...]]></description><category></category></item><item><title><![CDATA[字符串水题]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/89222653</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/89222653</guid><author>AC_hunter</author><pubDate>Thu, 11 Apr 2019 23:23:31 +0800</pubDate><description><![CDATA[HDU - 1686

给A串B串，求A串在B串中出现次数。

A串kmp预处理，然后再对A,B比较，用j表示匹配时A串的pos，则当j&gt;=strlen(A)时候，ans++；







HDU - 2087

给A串和B串，求从A串中能割出来多少个B串。

对A串和B串进行预处理，这个kmp_next数组是基于A和B串的。

即正常的kmp是对同一个串的前缀和当前位置进行比...]]></description><category></category></item><item><title><![CDATA[NCPC2018 Delivery Delays]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/88551625</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/88551625</guid><author>AC_hunter</author><pubDate>Thu, 14 Mar 2019 13:56:44 +0800</pubDate><description><![CDATA[题意：你经营着一家披萨店，该披萨店在1号点，每天都会有很多的订单，第i个订单是在si时刻发来的，收货地点在ui，该披萨在ti时刻才可以做好。问你每个订单的收货时间-发出时间（即买家等待时间）的最大值 的最小值 是多少。

即用dp[i]表示第i个订单，让你最小化 Max{dp[i]-s[i]}。

数据输入：

第一行：n(点的数目,n&amp;lt;=1000),m(边的数目,m&amp;lt;=5000...]]></description><category></category></item><item><title><![CDATA[2018 icpc 青岛现场赛(训练用） 嘴炮记录]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/84947684</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/84947684</guid><author>AC_hunter</author><pubDate>Mon, 10 Dec 2018 22:30:04 +0800</pubDate><description><![CDATA[C - Flippy Sequence

 水题


#include&amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
int a[10000000];
bool c[10000000];
int main()
{
    int T;
    scanf(&quot;%d&quot;,&amp;amp;T);
    int n;
    int cnt;
    long long l...]]></description><category></category></item><item><title><![CDATA[超神读入挂]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/81808007</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/81808007</guid><author>AC_hunter</author><pubDate>Sat, 18 Aug 2018 13:31:13 +0800</pubDate><description><![CDATA[收割成功


namespace fastIO{
    #define BUF_SIZE 100000
    #define OUT_SIZE 100000
    #define ll long long
    //fread-&amp;gt;read
    bool IOerror=0;
    inline char nc(){
        static char buf[BUF_SIZ...]]></description><category></category></item><item><title><![CDATA[2018杭电多校 第五场 1007补题 线段树]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/81482600</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/81482600</guid><author>AC_hunter</author><pubDate>Tue, 07 Aug 2018 15:48:14 +0800</pubDate><description><![CDATA[少壮不努力，自挂线段树。

被打的自闭成环了，唉。

 

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6356

AC（跑的死慢的）代码


#include&amp;lt;bits/stdc++.h&amp;gt;
#define INF 0x3f3f3f3f
#define lson l, mid, pos&amp;lt;&amp;lt;1
#define rson mid...]]></description><category></category></item><item><title><![CDATA[2018杭电多校第四场 1002 Harvest of Apples 莫队大法好~]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/81354414</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/81354414</guid><author>AC_hunter</author><pubDate>Thu, 02 Aug 2018 10:43:55 +0800</pubDate><description><![CDATA[Problem B. Harvest of Apples

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 1169    Accepted Submission(s): 443

Problem Description

There...]]></description><category></category></item><item><title><![CDATA[HNU校内训练 Skeletons Tehran 2016 反向建边]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/81295847</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/81295847</guid><author>AC_hunter</author><pubDate>Tue, 31 Jul 2018 09:11:58 +0800</pubDate><description><![CDATA[抱歉没时间仔细讲解

，先mark一下，以后再更。


			S

			keletons
			
		Time Limit: 10000ms, Special Time Limit:25000ms, Memory Limit:524288KB
		Total submit users: 6, Accepted users: 1
		Problem 14126 : No special judge...]]></description><category></category></item><item><title><![CDATA[2018杭电多校第一场补题1008 RMQ Similar Sequence 笛卡尔树]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/81214128</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/81214128</guid><author>AC_hunter</author><pubDate>Thu, 26 Jul 2018 10:11:40 +0800</pubDate><description><![CDATA[RMQ Similar Sequence

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 255535/255535 K (Java/Others)
Total Submission(s): 231    Accepted Submission(s): 41
 

Problem Description

Chiaki has a ...]]></description><category></category></item><item><title><![CDATA[2018杭电多校第二场补题 1005 Hack It 数论]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/81214033</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/81214033</guid><author>AC_hunter</author><pubDate>Thu, 26 Jul 2018 09:25:49 +0800</pubDate><description><![CDATA[Hack It

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 450    Accepted Submission(s): 130Special Judge
 

Problem Description

Tonyfang is a ...]]></description><category></category></item><item><title><![CDATA[HDOJ2018多校第一场补题1007 Chiaki Sequence Revisted]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/81194766</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/81194766</guid><author>AC_hunter</author><pubDate>Wed, 25 Jul 2018 00:14:06 +0800</pubDate><description><![CDATA[emmmmmm

事先声明下，这题不是我补的，毕竟对于数学八字不合，是我队友补的，然后，由于B站优良的学习氛围，他选择了在B站上发，我就当个板砖工了~

B站链接:https://www.bilibili.com/read/cv795958

 



题意是，给了一个数列的递推公式，让我们求前缀和Sn，一共有T组case，Sn可能很大，答案对10^9+7取余数，n为 &amp;lt;= 10^18的正整...]]></description><category></category></item><item><title><![CDATA[2018杭电多校第一场补题1002 Balanced Sequence 流水线排序]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/81178604</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/81178604</guid><author>AC_hunter</author><pubDate>Tue, 24 Jul 2018 09:48:48 +0800</pubDate><description><![CDATA[Balanced Sequence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1469    Accepted Submission(s): 155
 

Problem Description

Chiaki has n str...]]></description><category></category></item><item><title><![CDATA[湖北省大学程序设计竞赛（网络同步赛）    D. Who killed Cock Robin]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/80041350</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/80041350</guid><author>AC_hunter</author><pubDate>Sun, 22 Apr 2018 18:51:47 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/104/C来源：牛客网题目描述          Who killed Cock Robin?       I, said the Sparrow, With my bow and arrow,I killed Cock Robin.       Who saw him die?       I, said the F...]]></description><category></category></item><item><title><![CDATA[ATRC2017 Column Addition]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/79864556</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/79864556</guid><author>AC_hunter</author><pubDate>Mon, 09 Apr 2018 12:16:29 +0800</pubDate><description><![CDATA[DescriptionA multi-digit column addition is a formula on adding two integers written like this:A multi-digit column addition is written on the blackboard, but the sum is not necessarily correct. We ca...]]></description><category></category></item><item><title><![CDATA[Artwork NCPC 2016]]></title><link>https://blog.youkuaiyun.com/AC_hunter/article/details/79825206</link><guid>https://blog.youkuaiyun.com/AC_hunter/article/details/79825206</guid><author>AC_hunter</author><pubDate>Thu, 05 Apr 2018 12:03:33 +0800</pubDate><description><![CDATA[DescriptionA template for an artwork is a white grid of n × m squares. The artwork will be created by painting q horizontal and vertical black strokes. A stroke starts from square (x1, y1), ends at sq...]]></description><category></category></item></channel></rss>