Hello,every one.I am here again.it's my second entry on codeforces,the same time I wrote the first one , I open another blog on China website Baidu.(though I seems like having many blogs , but I think it will be the most useful one.also these problems is mainly for people in my level,I am a rookie:))here is the link: http://hi.baidu.com/new/YAIMH1993. till now I just write one entry on my Baidu blog(I think the number will be more later:)),the only one entry is about the problems on Network follow.I think it is a at least not bad entry because I spend mush time translating the descriptions from English to Chinese(just for fun:)). and the problems are sellected from Hangzhou Dangzhou Dianzi University(we Chinese always call it HDU or HOJ),below is the link of the school Online Judge: http://acm.hdu.edu.cn/ you can register an Id and do problems on it.if you are a Div.1 level programmer,I think you can do the problems starting from the last one , because these problems are new and the proportion of hard problems are bigger than the proportion among early problems. now I want to write the link of problems of network follow on HDU(if you are Chinese,please read my Baidu blog ,it's easy for you to find the solution),and i will write the difficulty of each problem before each link of problem(range from 0 to 5,though HDU is a Chinese OJ,the problems are mainly wrote in English,so don't be afriad of click the link:))

hdu 1281 difficulty:2 link:http://acm.hdu.edu.cn/showproblem.php?pid=1281

hdu 1532 difficulty:0 http://acm.hdu.edu.cn/showproblem.php?pid=1532

hdu 1533 difficulty:1 http://acm.hdu.edu.cn/showproblem.php?pid=1533

hdu 1569 difficulty:1 http://acm.hdu.edu.cn/showproblem.php?pid=1569

hdu 1733 difficulty:4 http://acm.hdu.edu.cn/showproblem.php?pid=1733

hdu 1853 difficulty:2 http://acm.hdu.edu.cn/showproblem.php?pid=1853

hdu 2732 difficulty:1 http://acm.hdu.edu.cn/showproblem.php?pid=2732

hdu 2883 difficulty:2 http://acm.hdu.edu.cn/showproblem.php?pid=2883

hdu 3061 difficulty:2 http://acm.hdu.edu.cn/showproblem.php?pid=3061

hdu 3081 difficulty:3 http://acm.hdu.edu.cn/showproblem.php?pid=3081

hdu 3277 difficulty:3.5 http://acm.hdu.edu.cn/showproblem.php?pid=3277

hdu 3313 difficulty:4,5 http://acm.hdu.edu.cn/showproblem.php?pid=3313

hdu 3315 difficulty:3 http://acm.hdu.edu.cn/showproblem.php?pid=3315

hdu 3338 difficulty: http://acm.hdu.edu.cn/showproblem.php?pid=3338

hdu 3376 difficulty:2 http://acm.hdu.edu.cn/showproblem.php?pid=3376

hdu 3416 difficulty:2.5 http://acm.hdu.edu.cn/showproblem.php?pid=3416

hdu 3435 difficulty:3 http://acm.hdu.edu.cn/showproblem.php?pid=3435

hdu 3488 difficulty:2 http://acm.hdu.edu.cn/showproblem.php?pid=3488

hdu 3549 difficulty:1(0) http://acm.hdu.edu.cn/showproblem.php?pid=3549

hdu 3879 difficulty:3 http://acm.hdu.edu.cn/showproblem.php?pid=3879

hdu 3998 difficulty:5 http://acm.hdu.edu.cn/showproblem.php?pid=3998

hdu 4067 difficulty:5 http://acm.hdu.edu.cn/showproblem.php?pid=4067

that's all , thank you:) except the last problem,I have solve the other problems,if you have any question,you can contect me: you can :

write comments to me ,

send messages to me on codeforces,

or my E-mail: youareinmyheart1993#gmail.com

if you can use QQ , my QQ id is 2321409600.

Recently I have heard an algorithm to solve network flow in o(n*logn),I don't know whether it's true,if you know it , please tell me ,thank you:)