<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[潮鸣り]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/secretbase_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; secretbase_]]></copyright><item><title><![CDATA[POJ 2676 Sudoku （DFS）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/49511189</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/49511189</guid><author>secretbase_</author><pubDate>Fri, 30 Oct 2015 14:22:46 +0800</pubDate><description><![CDATA[数独，开三个标记，直接暴力，400多mS还是可以接受的
#include
#include
#include
#include
#include
#include
#include
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int M = 1010;

int vish[15][15]]]></description><category></category></item><item><title><![CDATA[POJ 3083 Children of the Candy Corn（BFS + DFS）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/49431189</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/49431189</guid><author>secretbase_</author><pubDate>Mon, 26 Oct 2015 23:03:33 +0800</pubDate><description><![CDATA[优先左转 优先右转  两点最短
#include
#include
#include
#include
#include
#include
#include
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int M = 1010;

int dir[][2] = { 0,-1,-1,0,0]]></description><category></category></item><item><title><![CDATA[HDU 1172 猜数字 （傻逼暴力题）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/49409391</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/49409391</guid><author>secretbase_</author><pubDate>Sun, 25 Oct 2015 23:50:32 +0800</pubDate><description><![CDATA[第一次做这么傻逼的暴力题，心塞塞。。
#include
#include
#include
#include
#include
#include
#include
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int M = 1010;

struct node
{
	int num, v]]></description><category></category></item><item><title><![CDATA[拓扑排序]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/49406617</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/49406617</guid><author>secretbase_</author><pubDate>Sun, 25 Oct 2015 20:54:32 +0800</pubDate><description><![CDATA[时间复杂度O（n+m）
int tuopu(int n)
{
    queueq;
    for(int i=1; i<=n; ++i)
    {
        if(indgree[i]==0)
        {
            q.push(i);
        }
    }

    while(!q.empty())
    {
        int u=q.fr]]></description><category></category></item><item><title><![CDATA[HDU 1242 Rescue （BFS+优先队列）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/49401559</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/49401559</guid><author>secretbase_</author><pubDate>Sun, 25 Oct 2015 09:50:28 +0800</pubDate><description><![CDATA[从天使的位置开始，直到找到r，优先队列每次选择最短时间的路
#include
#include
#include
#include
#include
#include
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int M = 1010;

struct node
{
	int x, y]]></description><category></category></item><item><title><![CDATA[HDU 1428 漫步校园（Spfa+记忆化搜索）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/49282799</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/49282799</guid><author>secretbase_</author><pubDate>Tue, 20 Oct 2015 21:01:09 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
using namespace std;
typedef long long LL;
const int M = 10000;
const int INF = 0x3f3f3f3f;

int n;
int dir[][2] = { 1,0,-1,0,0,-1,0,1 };
int mp[5]]></description><category></category></item><item><title><![CDATA[HDU 1078 FatMouse and Cheese （记忆化搜索）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/49253833</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/49253833</guid><author>secretbase_</author><pubDate>Mon, 19 Oct 2015 19:30:30 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
using namespace std;
typedef long long LL;
const int M = 10000;
const int INF = 0x3f3f3f3f;

int n, k;
int dir[][2] = { 1,0,-1,0,0,1,0,-1 };
int dp[105][10]]></description><category></category></item><item><title><![CDATA[POJ 3616 Milking Time（DP）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/49230981</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/49230981</guid><author>secretbase_</author><pubDate>Sun, 18 Oct 2015 21:05:32 +0800</pubDate><description><![CDATA[dp[i]= i-1时间段产奶量 + 现在的产奶量
#include
#include
#include
#include
#include
using namespace std;
typedef long long LL;
const int M = 10000;
const int INF = 0x3f3f3f3f;

struct  node
{
	int st, et, w;
	boo]]></description><category></category></item><item><title><![CDATA[HDU 2859 Phalanx（DP）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/49230161</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/49230161</guid><author>secretbase_</author><pubDate>Sun, 18 Oct 2015 19:48:39 +0800</pubDate><description><![CDATA[基础DP
#include
#include
#include
#include
#include
using namespace std;
typedef long long LL;
const int M = 10000;
const int INF = 0x3f3f3f3f;

string s[1050];
int dp[1050][1050];
//char s[1050][1050]]]></description><category></category></item><item><title><![CDATA[POJ 1661 Help Jimmy （DP）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/49029667</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/49029667</guid><author>secretbase_</author><pubDate>Sat, 10 Oct 2015 21:06:45 +0800</pubDate><description><![CDATA[dp[i][j], j = 0, 1 (dp[i][0]表示以i号平台左边为起点到地面的最短时间，dp[i][1]]表示以i号平台右边为起点到地面的最短时间)
状态转移方程：

dp[i][0] = H[i] - H[m] + Min (dp[m][0] + X1[i] - X1[m], dp[m][1] + X2[m] - X1[i]);  m为i左边下面的平台的编号
dp[i][1] ]]></description><category></category></item><item><title><![CDATA[POJ 3186 Treats for the Cows (DP)]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/48979733</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/48979733</guid><author>secretbase_</author><pubDate>Thu, 08 Oct 2015 21:33:22 +0800</pubDate><description><![CDATA[从里到外逆推
//#pragma commmpnt(linkmpr, "/STACK:102400000,102400000")
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
typedef long long LL;
const int M = 100010;
const int]]></description><category></category></item><item><title><![CDATA[POJ 2533 Longest Ordered Subsequence （LIS）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/48951717</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/48951717</guid><author>secretbase_</author><pubDate>Wed, 07 Oct 2015 19:30:36 +0800</pubDate><description><![CDATA[最长上升子序列
O(n*logn)
//#pragma commmpnt(linkmpr, "/STACK:102400000,102400000")
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
typedef long long LL;
const int M = 10001]]></description><category></category></item><item><title><![CDATA[HDU 1160 FatMouse's Speed（DP）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/48951481</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/48951481</guid><author>secretbase_</author><pubDate>Wed, 07 Oct 2015 18:46:56 +0800</pubDate><description><![CDATA[//#pragma commmpnt(linkmpr, "/STACK:102400000,102400000")
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
typedef long long LL;
const int M = 100010;
const int INF =0x]]></description><category></category></item><item><title><![CDATA[HDU 1114 Piggy-Bank （完全背包）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/48936933</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/48936933</guid><author>secretbase_</author><pubDate>Tue, 06 Oct 2015 21:47:53 +0800</pubDate><description><![CDATA[完全背包

for 
i=[0,n)
    for(j=weight[i]; j
        tab[j] = max(tab[j-weight[i]]+value[i],tab[j])

//#include 
#include 
#include 
#include 
using namespace std;
typedef long long LL;
const int ]]></description><category></category></item><item><title><![CDATA[POJ 1330 Nearest Common Ancestors （LAC）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/48595201</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/48595201</guid><author>secretbase_</author><pubDate>Sun, 20 Sep 2015 10:51:12 +0800</pubDate><description><![CDATA[LCA转RMQ 在线算法，，，
//#pragma commmpnt(linkmpr, "/STACK:102400000,102400000")
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
typedef long long LL;
const int M = 100010;
]]></description><category></category></item><item><title><![CDATA[HDU 4762 Cut the Cake （高精度 + 公式）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/48321027</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/48321027</guid><author>secretbase_</author><pubDate>Wed, 09 Sep 2015 19:23:29 +0800</pubDate><description><![CDATA[可得公式：  n / (m^(n-1))
import java.io.*;
import java.math.*;
import java.util.*;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nex]]></description><category></category></item><item><title><![CDATA[POJ 3261 Milk Patterns (可重叠的出现K次的最长重复子串)]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/48263825</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/48263825</guid><author>secretbase_</author><pubDate>Mon, 07 Sep 2015 12:01:49 +0800</pubDate><description><![CDATA[//#pragma commmpnt(linkmpr, "/STACK:102400000,102400000")
#include 
#include 
#include 
#include 
#include 
using namespace std;
typedef long long LL;
const int M = 10055;

/* *suffix array *倍增算法  O(n]]></description><category></category></item><item><title><![CDATA[POJ 1743 Musical Theme （不可重叠最长重复子串）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/48262651</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/48262651</guid><author>secretbase_</author><pubDate>Mon, 07 Sep 2015 10:52:36 +0800</pubDate><description><![CDATA[后缀数组+二分答案

题目：找到一个字符串内长度不小于五的最长不重复字串，字串的所有数字同时加上或减去一同一个数也算重复出现。
解析：首先最所有数字作差，原数据为a[i]新数据为a[i]=a[i+1]-a[i]，这样一来及时原先的字串是进行过加或减那他们的差值也会相同，所以转换为求现有a[]中大与5的最长重复字串，用后缀数组。首先由二分答案的方法将问题变成判定性的：长度大于k的重复字串有没有]]></description><category></category></item><item><title><![CDATA[HDU 4080 Stammering Aliens （后缀数组 + 二分答案）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/48194067</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/48194067</guid><author>secretbase_</author><pubDate>Thu, 03 Sep 2015 12:01:01 +0800</pubDate><description><![CDATA[//#pragma commmpnt(linkmpr, "/STACK:102400000,102400000")
#include 
#include 
#include 
#include 
#include 
using namespace std;
typedef long long LL;
const int M = 10005;

/* *suffix array *倍增算法  O(n]]></description><category></category></item><item><title><![CDATA[HDU 4705 Y （树形DP）]]></title><link>https://blog.youkuaiyun.com/secretbase_/article/details/47813715</link><guid>https://blog.youkuaiyun.com/secretbase_/article/details/47813715</guid><author>secretbase_</author><pubDate>Thu, 20 Aug 2015 19:55:29 +0800</pubDate><description><![CDATA[思路：反面考虑，用总的方案数减去A，B，C三点在同一路径上的方案数。于是我们可以确定中间点B，在当前以B为根求得的son中任选一个，在剩下的节点n-tmp-1（tmp为已经求得的B的儿子的个数）中任选一个,产生tmp*(n-tmp-1)中组合。
//#pragma comment(linker, "/STACK:102400000,102400000")
#pragma comment(link]]></description><category></category></item></channel></rss>