<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[AC_Machine的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/AC_Machine</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; AC_Machine]]></copyright><item><title><![CDATA[Wannafly挑战赛10   F.小H和遗迹]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/79382247</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/79382247</guid><author>AC_Machine</author><pubDate>Mon, 26 Feb 2018 22:29:19 +0800</pubDate><description><![CDATA[时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 262144K，其他语言524288K 64bit IO Format: %lld题目描述    小H在一片遗迹中发现了一种古老而神秘的文字，这种文字也由26种字母组成，小H用小写字母来代替它们。遗迹里总共有N句话，由于年代久远，每句话都至少有一处无法辨识，用#表示，缺失的可能是任意长度(也包括0)的任意字符串。     小H发现这些话...]]></description><category></category></item><item><title><![CDATA[Sublime Text 3在Windows下配置C++环境]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/60765491</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/60765491</guid><author>AC_Machine</author><pubDate>Tue, 07 Mar 2017 18:05:51 +0800</pubDate><description><![CDATA[之前用codeblocks写c++，感觉c++语法很麻烦而且codeblocks界面和字体又不好看，所以一直不喜欢用c++写代码。最近感觉很有必要转一下c++，就在网上找更好看的编辑器，无奈vim和emacs上手都很慢，就找到了sublime text，感觉界面字体真的很棒棒啊，就愉快地决定以后用它写c++了。
    sublime text给用户留下了很大的配置空间，c/c++的代码在win]]></description><category></category></item><item><title><![CDATA[HDU-3397 线段树+区间合并]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/54898212</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/54898212</guid><author>AC_Machine</author><pubDate>Mon, 06 Feb 2017 23:30:36 +0800</pubDate><description><![CDATA[Sequence operation
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8068    Accepted Submission(s): 2416



Problem Description

lxhgww]]></description><category></category></item><item><title><![CDATA[Nachos操作系统课设 浅谈优先级调度]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/53845032</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/53845032</guid><author>AC_Machine</author><pubDate>Fri, 23 Dec 2016 23:36:17 +0800</pubDate><description><![CDATA[题目
Task1.5 实现优先级调度
  Implement priority scheduling in Nachos by completing the PriorityScheduler class. Priority scheduling is a key building
 block in real-time systems. Note that in order to use]]></description><category></category></item><item><title><![CDATA[POJ-2778 ac自动机+矩阵快速幂]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52724080</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52724080</guid><author>AC_Machine</author><pubDate>Sun, 02 Oct 2016 16:49:27 +0800</pubDate><description><![CDATA[DNA Sequence




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 15422
 
Accepted: 5954




Description

It's well known that DNA Sequence is a sequence only contains]]></description><category></category></item><item><title><![CDATA[HDU-5893 树链剖分+区间合并]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52591005</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52591005</guid><author>AC_Machine</author><pubDate>Tue, 20 Sep 2016 01:03:56 +0800</pubDate><description><![CDATA[List wants to travel
Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 446    Accepted Submission(s): 101



Problem Description

A boy]]></description><category></category></item><item><title><![CDATA[UVA-11990 动态逆序对]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52554705</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52554705</guid><author>AC_Machine</author><pubDate>Fri, 16 Sep 2016 11:57:29 +0800</pubDate><description><![CDATA[题目链接：
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3141



题目大意：
给出一个1-n的排列A，要求按照某种顺序删除一些数（其他数顺序不变），输出每次删除之前逆序对的数目。


解题思路：
动态逆序对，在线的话用块状数组]]></description><category></category></item><item><title><![CDATA[HDU-5324 cdq分治]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52550609</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52550609</guid><author>AC_Machine</author><pubDate>Thu, 15 Sep 2016 19:16:38 +0800</pubDate><description><![CDATA[Boring Class
Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1444    Accepted Submission(s): 460



Problem Description

Mr. Zstu and M]]></description><category></category></item><item><title><![CDATA[快速傅里叶变换入门]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52433607</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52433607</guid><author>AC_Machine</author><pubDate>Sun, 04 Sep 2016 17:45:29 +0800</pubDate><description><![CDATA[http://blog.miskcoo.com/2015/04/polynomial-multiplication-and-fast-fourier-transform]]></description><category></category></item><item><title><![CDATA[POJ-1741 点分治]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52302038</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52302038</guid><author>AC_Machine</author><pubDate>Wed, 24 Aug 2016 16:53:01 +0800</pubDate><description><![CDATA[Tree




Time Limit: 1000MS
 
Memory Limit: 30000K


Total Submissions: 18156
 
Accepted: 5930




Description

Give a tree with n vertices,each edge has a length(positive integer l]]></description><category></category></item><item><title><![CDATA[HDU-5371 Manacher+线段树维护]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52172139</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52172139</guid><author>AC_Machine</author><pubDate>Wed, 10 Aug 2016 15:40:57 +0800</pubDate><description><![CDATA[Hotaru's problem
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 3123    Accepted Submission(s): 1057



Problem Description

Hotaru Ic]]></description><category></category></item><item><title><![CDATA[HDU-5790 Tire树+主席树]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52167010</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52167010</guid><author>AC_Machine</author><pubDate>Tue, 09 Aug 2016 23:07:21 +0800</pubDate><description><![CDATA[Prefix
Time Limit: 2000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 474    Accepted Submission(s): 150



Problem Description

Alice gets N strings.]]></description><category></category></item><item><title><![CDATA[HDU-5801 可持久化Trie树]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52131499</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52131499</guid><author>AC_Machine</author><pubDate>Fri, 05 Aug 2016 18:07:54 +0800</pubDate><description><![CDATA[Up Sky,Mr.Zhu
Time Limit: 3000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 46    Accepted Submission(s): 14



Problem Description

Given a string S]]></description><category></category></item><item><title><![CDATA[HDU-5785 Manacher+区间处理]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52104230</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52104230</guid><author>AC_Machine</author><pubDate>Wed, 03 Aug 2016 15:41:16 +0800</pubDate><description><![CDATA[Interesting
Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 349    Accepted Submission(s): 121



Problem Description

Alice get a st]]></description><category></category></item><item><title><![CDATA[LightOJ-1031 博弈 区间DP]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52089829</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52089829</guid><author>AC_Machine</author><pubDate>Mon, 01 Aug 2016 22:41:11 +0800</pubDate><description><![CDATA[1031 - Easy Game




   
PDF (English)
Statistics
Forum








Time Limit: 2 second(s)
Memory Limit: 32 MB





You are playing a two player game. Initially there are n intege]]></description><category></category></item><item><title><![CDATA[LightOJ-1013 LCS+递推]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52087848</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52087848</guid><author>AC_Machine</author><pubDate>Mon, 01 Aug 2016 17:54:47 +0800</pubDate><description><![CDATA[1013 - Love Calculator




   
PDF (English)
Statistics
Forum








Time Limit: 2 second(s)
Memory Limit: 32 MB





Yes, you are developing a 'Love calculator'. The software]]></description><category></category></item><item><title><![CDATA[HDU-4729 树链剖分+主席树]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/52081749</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/52081749</guid><author>AC_Machine</author><pubDate>Sun, 31 Jul 2016 23:29:46 +0800</pubDate><description><![CDATA[An Easy Problem for Elfness
Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 1207    Accepted Submission(s): 249



Problem Description]]></description><category></category></item><item><title><![CDATA[POJ-1330 LCA的两种写法]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/51638451</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/51638451</guid><author>AC_Machine</author><pubDate>Sat, 11 Jun 2016 22:28:36 +0800</pubDate><description><![CDATA[方法一：RMQ
对树做一次dfs序，记录每个节点在dfs序中的初始位置以及每个节点在树中的深度，查询两节点初始位置所形成的区间中深度最小的节点即为两者的最近公共祖先，查询部分采用RMQ即可。
import java.util.*;
public class Main {
	static int T,n,ee,a,b,c,kk,rt,ans;
	static int[] dd=new int[1]]></description><category></category></item><item><title><![CDATA[二分图最大权匹配--KM算法模板]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/51538972</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/51538972</guid><author>AC_Machine</author><pubDate>Mon, 30 May 2016 16:32:18 +0800</pubDate><description><![CDATA[KM算法我是看了训练指南学会的，指出上面的一处错误，当时纠结了好久才发现，在349页情况二中第一个S应该是S‘。
模板代码如下：
import java.util.*;

public class Main {
	static int n,min;
	static int[] ss=new int[105];
	static int[] tt=new int[105];
	static int]]></description><category></category></item><item><title><![CDATA[GYM 100796C Minimax Tree]]></title><link>https://blog.youkuaiyun.com/AC_Machine/article/details/50365343</link><guid>https://blog.youkuaiyun.com/AC_Machine/article/details/50365343</guid><author>AC_Machine</author><pubDate>Sun, 20 Dec 2015 19:46:07 +0800</pubDate><description><![CDATA[C. Minimax Tree


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



Bob's new favourite toy is a rooted tree tha]]></description><category></category></item></channel></rss>