<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ctrss的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ctrss</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ctrss]]></copyright><item><title><![CDATA[本博客暂停更新，以后文章请见https://ctrasd.github.io/]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/52740780</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/52740780</guid><author>ctrss</author><pubDate>Wed, 05 Oct 2016 21:39:35 +0800</pubDate><description><![CDATA[本博客暂停更新，以后文章请见https://ctrasd.github.io/]]></description><category></category></item><item><title><![CDATA[HDU 5573 Binary Tree 找规律二进制]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/52046915</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/52046915</guid><author>ctrss</author><pubDate>Wed, 27 Jul 2016 16:53:11 +0800</pubDate><description><![CDATA[Binary Tree
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 562    Accepted Submission(s): 321
Special Judge


Problem Description

The]]></description><category></category></item><item><title><![CDATA[HDU 5754 Life Winner Bo 博弈]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/52045416</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/52045416</guid><author>ctrss</author><pubDate>Wed, 27 Jul 2016 15:02:08 +0800</pubDate><description><![CDATA[这次多校感觉全是数学题啊……然而最不会的就是数学题……




Life Winner Bo
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1035    Accepted Submission(s): 379]]></description><category></category></item><item><title><![CDATA[HDU 5521 Meeting 化简边的最短路]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/52025027</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/52025027</guid><author>ctrss</author><pubDate>Mon, 25 Jul 2016 16:57:44 +0800</pubDate><description><![CDATA[Meeting
Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 1376    Accepted Submission(s): 441



Problem Description

Bessie and her f]]></description><category></category></item><item><title><![CDATA[CF 699D Fix a Tree 并查集]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51968830</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51968830</guid><author>ctrss</author><pubDate>Wed, 20 Jul 2016 15:39:49 +0800</pubDate><description><![CDATA[D. Fix a Tree


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



A tree is an undirected connected graph witho]]></description><category></category></item><item><title><![CDATA[初识python 交叉排序]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51560258</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51560258</guid><author>ctrss</author><pubDate>Thu, 02 Jun 2016 00:41:14 +0800</pubDate><description><![CDATA[好吧，断断续续的在计蒜客上学了几次python，感觉语法很反人类，虽然当年刚从pascal转到c的时候也觉得c的语法很繁琐，不过好歹c的编译器都很nice，debug强大，但是在ubuntu下用sublime进行debug简直是噩梦（好吧，其实只是自己太懒又太水不愿意又不会写插件……）
最近想了想以后大概的方向，可能也就是机器学习或者是计算机图形这两大块了……在数学系想要去跟cs的人比项目估计是]]></description><category></category></item><item><title><![CDATA[hdu 4355 Party All the Time  初识三分法]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51542384</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51542384</guid><author>ctrss</author><pubDate>Tue, 31 May 2016 01:09:00 +0800</pubDate><description><![CDATA[以前听到三分法的时候总是一脸懵逼，心想三分了怎么继续确定区间，三分的两个点又怎么确定？想破头也想不出来。
今天偷偷看了西工大某美女姐姐（好吧，虽然没见过，就这么叫吧）的博客，发现三分竟然是有特定条件的……
先来说说三分法，据前人的研究，三分法适用于凹凸函数求它的凹凸点。与二分法不同的是三分法将mid点与r点的中间点也并入讨论，设其为mmid点。
显然，mmid>mid.
以凹函数为例子，求]]></description><category></category></item><item><title><![CDATA[cf676c Vasya and String 尺取法裸题]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51506899</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51506899</guid><author>ctrss</author><pubDate>Thu, 26 May 2016 14:25:30 +0800</pubDate><description><![CDATA[C. Vasya and String


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



High school student Vasya got a string o]]></description><category></category></item><item><title><![CDATA[dinic网络流前向星写法]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51457799</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51457799</guid><author>ctrss</author><pubDate>Thu, 19 May 2016 23:12:09 +0800</pubDate><description><![CDATA[终于照着模板打了一遍前向星……
虽然还不是太懂……
直接上代码吧……依然是poj1273的题


#include
#include
#include
#include
#define  M 400
int INF=10000001;
using namespace std;

struct node
{
	int u,v,cap,next;
};
node edge[M*M];
int]]></description><category></category></item><item><title><![CDATA[poj1273完全不懂为何过的dinic最大流模板]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51440213</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51440213</guid><author>ctrss</author><pubDate>Tue, 17 May 2016 23:05:28 +0800</pubDate><description><![CDATA[Drainage Ditches




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 67615
 
Accepted: 26138




Description

Every time it rains on Farmer John's fields, a pond form]]></description><category></category></item><item><title><![CDATA[poj1681Painter's Problem 增广矩阵消元法错误水过版]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51392617</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51392617</guid><author>ctrss</author><pubDate>Fri, 13 May 2016 09:52:41 +0800</pubDate><description><![CDATA[Painter's Problem




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 5519
 
Accepted: 2660




Description

There is a square wall which is made of n*n small square ]]></description><category></category></item><item><title><![CDATA[cf 670D2 Magic Powder - 2 二分裸题]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51379567</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51379567</guid><author>ctrss</author><pubDate>Thu, 12 May 2016 00:22:32 +0800</pubDate><description><![CDATA[D2. Magic Powder - 2 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard outputWaking up in the morning, Apollinaria decided to bake cookies. To bake o]]></description><category></category></item><item><title><![CDATA[zoj 1196 Fast Food 变种区间dp]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51360613</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51360613</guid><author>ctrss</author><pubDate>Tue, 10 May 2016 10:01:45 +0800</pubDate><description><![CDATA[好吧，其实我觉得这个题在一开始想的时候与区间dp还是有点差别的……虽然写出来跟区间dp确实差不多

Fast Food

Time Limit: 2 Seconds      
Memory Limit: 65536 KB 

The fastfood chain McBurger owns several restaurants along a highway. Recently,]]></description><category></category></item><item><title><![CDATA[poj1141Brackets Sequence 区间dp+输出路径]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51326685</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51326685</guid><author>ctrss</author><pubDate>Thu, 05 May 2016 22:27:50 +0800</pubDate><description><![CDATA[最近看区间dp也看了好几题了，终于知道了大概的思路，当然只是大概……只会套模板，稍微变一变就GG了，还是没真正理解……
先上区间dp的超级简单好写的模板
for(l=0;l
  for(i=0,j=i+l;j
    { 如果可以更新或初始化，更新或初始化dp[i][j]，
    for(k=i;k
      比较dp[i][j]和dp[i][k]+dp[k+1][j]，如果能更新]]></description><category></category></item><item><title><![CDATA[hdu 1102 最小生成树prim模板题]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51316656</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51316656</guid><author>ctrss</author><pubDate>Wed, 04 May 2016 17:41:33 +0800</pubDate><description><![CDATA[作为为数不多的到现在还记得的初三时学过的算法……先来介绍一下什么是最小生成树和prim……
做为一个图，它肯定有很多条边，然后呢，从中选出n-1条边，使得所有点都能连起来，且边权和最小，这就是最小生成树，可以保证n个定点的最小生成树只有n-1条边
然后，关于prim
我初三时的理解是：对于所有边，先选出其中符合条件的最短的一条，符合条件指的是保证这条边的两个顶点有一条没有被选取过，有一条被选]]></description><category></category></item><item><title><![CDATA[spfa初探]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51312374</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51312374</guid><author>ctrss</author><pubDate>Wed, 04 May 2016 09:43:04 +0800</pubDate><description><![CDATA[下面先来看一下spfa是什么
转载自http://www.cnblogs.com/scau20110726/archive/2012/11/18/2776124.html




粗略讲讲SPFA算法的原理，SPFA算法是1994年西安交通大学段凡丁提出

是一种求单源最短路的算法

算法中需要用到的主要变量

int n;  //表示n个点，从1到n标号

int s]]></description><category></category></item><item><title><![CDATA[poj 3070 矩阵快速幂求斐波拉契数列]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51303793</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51303793</guid><author>ctrss</author><pubDate>Tue, 03 May 2016 13:50:54 +0800</pubDate><description><![CDATA[Fibonacci




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 12324
 
Accepted: 8746




Description


In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn]]></description><category></category></item><item><title><![CDATA[poj 1061 青蛙的约会  扩展欧几里得]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51276280</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51276280</guid><author>ctrss</author><pubDate>Thu, 28 Apr 2016 17:55:19 +0800</pubDate><description><![CDATA[写在前面：关于扩展欧几里得
已知存在数x,y使得对于确定的a,b有ax+by=gcd(a,b)，所以对于一般的ax+by=c，只要gcd(a,b)能够整除c，就一定存在解x,y，且解的个数为c/gcd(a,b)。
关于如何求x,y
ax+by=gcd(a,b)=gcd(b,a%b)=bx'+(a%b)y',整理之后可以得到x=y',y=(x'-a/cy')，又因为gcd(d,0)（d为gcd]]></description><category></category></item><item><title><![CDATA[hdu 2112HDU Today 最短路+map]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51263645</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51263645</guid><author>ctrss</author><pubDate>Wed, 27 Apr 2016 19:22:08 +0800</pubDate><description><![CDATA[HDU Today
Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 23041    Accepted Submission(s): 5515


Problem Description
经过锦囊相助，海东集团终于度过了危机]]></description><category></category></item><item><title><![CDATA[hdu 4544 优先队列]]></title><link>https://blog.youkuaiyun.com/ctrss/article/details/51236776</link><guid>https://blog.youkuaiyun.com/ctrss/article/details/51236776</guid><author>ctrss</author><pubDate>Sun, 24 Apr 2016 23:31:05 +0800</pubDate><description><![CDATA[湫湫系列故事——消灭兔子
Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 2144    Accepted Submission(s): 689


Problem Description
　　湫湫减肥
　　越减越肥！
　]]></description><category></category></item></channel></rss>