yibin94-CSDN博客

原创 Educational Codeforces Round 11--A. Co-prime Array

A. Co-prime Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array of n elements, you

2016-04-10 19:30:59 407

原创 POJ 1459-Power Network(网络流_最大流）

Power NetworkTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1459DescriptionA power network consists of nodes (power stat

2016-04-09 11:38:57 462

原创 Educational Codeforces Round 11---B-Seating On Bus

B. Seating On Bustime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputConsider 2n rows of the seats in a bus. n

2016-04-09 09:36:17 662

原创 POJ -- 2253 -- Frogger (最短路变形)

FroggerTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2253DescriptionFreddy Frog is sitting on a stone in the middle of

2016-04-07 16:08:59 449

转载 C++STL 常用函数用法

【大爱】C++STL 常用函数用法　　学完c++快一年了，感觉很有遗憾，因为一直没有感觉到c++的强大之处，当时最大的感觉就是这个东西的输入输出比C语言要简单好写。　　后来我发现了qt，opencv，opengl，原来，c++好玩的狠。　　在这些图形库之外，最常用的可能就是STL，这个东西由于当时学c++的时候迷迷糊糊，完全是一头雾水，上学期数据结构之后开始有点儿开窍了，现在把

2016-04-03 22:40:22 376

原创 POJ 1094 -- Sorting It All Out （拓扑排序）

Sorting It All OutTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1094DescriptionAn ascending sorted sequence of distinct

2016-04-03 22:30:28 354

转载 strcpy 和 memcpy 用法的区别

strcpy和memcpy的区别strcpy和memcpy都是标准C库函数，它们有下面的特点。strcpy提供了字符串的复制。strcpy只用于字符串复制，并且它不仅复制字符串内容之外，还会复制字符串的结束符。已知strcpy函数的原型是：char* strcpy(char* dest, const char* src);memcpy提供了一般内存的复制。即memcpy对于

2016-04-03 22:24:15 360

原创 POJ 1125 -- Stockbroker Grapevine （弗洛伊德最短路）

Stockbroker GrapevineTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1125DescriptionStockbrokers are known to overreact t

2016-04-02 22:36:02 1571

原创 poj 1789--Truck History 最小生成树(prim)

Truck HistoryTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1789DescriptionAdvanced Cargo Movement, Ltd. uses trucks of di

2016-04-02 19:14:52 401

原创 CSU 1712--Refract Facts

Refract FactsTime Limit:1000MS Memory Limit:131072KB 64bit IO Format:%lld & %lluSubmit Status Practice CSU 1712DescriptionInputOutput

2016-04-02 18:59:38 562

原创 POJ 3020 Antenna Placement(二分图匹配）

Antenna PlacementTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3020DescriptionThe Global Aerial Research Centre has bee

2016-03-31 21:53:58 487

原创 Codeforces Round #346 (Div. 2)--A. Round House

A. Round Housetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya lives in a round building, whose entran

2016-03-31 16:01:05 380

原创 Codeforces Round #346 (Div. 2)--B. Qualifying Contest

B. Qualifying Contesttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVery soon Berland will hold a School T

2016-03-31 15:46:26 443

原创 Codeforces Round #346 (Div. 2)--C. Tanya and Toys

C. Tanya and Toystime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn Berland recently a new collection of

2016-03-31 15:28:29 409

原创 POJ 1860:Currency Exchange （spfa 判环）

Currency ExchangeTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionSeveral currency exchange points are working in our city. Let

2016-03-27 14:14:14 442

原创 POJ 1062 昂贵的聘礼（限制的最短路）

昂贵的聘礼Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险

2016-03-27 13:55:08 980

转载网络流入门—用于最大流的Dinic算法

网络流入门—用于最大流的Dinic算法Posted 2011年05月2日 by comzyh“网络流博大精深”—sideman语一个基本的网络流问题感谢WHD的大力支持最早知道网络流的内容便是最大流问题，最大流问题很好理解：解释一定要通俗!如右图所示,有一个管道系统,节点{1,2,3,4},有向管道{A,B,C,D,E},即有

2016-03-25 18:54:51 362

转载拓扑排序详解

本文链接：http://www.cnblogs.com/Yan-C/p/3943940.html 1、拓扑排序　　我们起床穿裤子和鞋子时，相信大部分人的顺序是这样的，先穿上内裤，然后再穿上裤子，再穿上袜子，然后才是鞋子。那么，我们把这些步骤分解：(1)穿内裤(2)穿裤子(3)穿袜子(4)穿鞋子我们把这四个步骤，按照上述的顺序

2016-03-25 18:48:21 774

原创 UESTC 1144 Big Brother

Big BrotherTime Limit:1000MS Memory Limit:65535KB 64bit IO Format:%lld & %lluSubmit Status Practice UESTC 1144Description现在有$n$个囚笼，需要关押$m$个犯人，the big brother很担心囚笼的安全性，因为犯

2016-03-23 23:26:16 450

原创 UESTC 1143

B - 传输数据Time Limit:1000MS Memory Limit:65535KB 64bit IO Format:%lld & %lluSubmit Status Practice UESTC 1143Description机房里面有m台电脑，n台网线，每条网线都每秒中最多传送的数据量，现在需要你计算从标号为1的电脑传送数据到编号

2016-03-23 22:13:23 395

转载 RMQ算法

1. 概述RMQ（Range Minimum/Maximum Query），即区间最值查询，是指这样一个问题：对于长度为n的数列A，回答若干询问RMQ（A,i,j）(i,j当然，该问题也可以用线段树（也叫区间树）解决，算法复杂度为：O(N)~O(logN)，这里我们暂不介绍。2.RMQ算法对于该问题，最容易想到的解决方案是遍历，复杂度是O(n)。但当数据量非常大

2016-03-23 21:00:03 270

原创 CF--#334-div2--B

B. More Cowbelltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKevin Sun wants to move his precious collection

2015-12-02 12:43:49 470

原创 hdu-- 计算机学院大学生程序设计竞赛（2015’11）

质方数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3247 Accepted Submission(s): 1080Problem Description 小明天生对数字比较敏感，3岁的时候就能背

2015-11-29 23:45:06 512

原创 hdu-- 计算机学院大学生程序设计竞赛（2015’11）

游乐场Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4269 Accepted Submission(s): 629Problem Description 小时候，因为家里经济困难，小明从未去过游乐

2015-11-29 23:31:43 595

原创 hdu-- 计算机学院大学生程序设计竞赛（2015’11）

油菜花王国Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1609 Accepted Submission(s): 411Problem Description 程序设计竞赛即将到来，作为学校ACM集

2015-11-29 23:28:27 554

原创 hdu-- 计算机学院大学生程序设计竞赛（2015’11）

投币洗衣机Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5878 Accepted Submission(s): 1460Problem Description 如今大学生的生活条件越来越好了，近期

2015-11-29 23:23:56 510

原创 hdu--计算机学院大学生程序设计竞赛（2015’11）

搬砖Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 4646 Accepted Submission(s): 1060Problem Description 小明现在是人见人爱，花见花开的高富帅，整天

2015-11-29 23:09:46 489

原创 CF--333--div2--A.Two Bases

A. Two Basestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter seeing the "ALL YOUR BASE ARE BELONG TO US" m

2015-11-25 12:56:06 551

原创 CF-332-div2-A. Patrick and Shopping

A. Patrick and Shoppingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday Patrick waits for a visit from his

2015-11-21 09:10:51 432

原创 HDU-1176 - 免费馅饼

免费馅饼Crawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice HDU 1176 Appoint description:p

2015-11-18 00:44:40 529

原创 CF--A. Wilbur and Swimming Pool

A. Wilbur and Swimming Pooltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter making bad dives into swimming pools

2015-11-16 13:44:35 504

原创 CF--B. Wilbur and Array

B. Wilbur and Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWilbur the pig is tinkering with arrays aga

2015-11-16 13:29:29 531

原创 CF--B - Queries on a String

B. Queries on a Stringtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a string s and should proc

2015-11-14 09:17:13 640

原创 CF--A. Tricky Sum

A. Tricky Sumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn this problem you are to calculate the sum of al

2015-11-14 08:54:00 594

原创 HDU 1087 Super Jumping! Jumping! Jumping!

B - Super Jumping! Jumping! Jumping!Crawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice HDU 10

2015-11-13 23:41:22 513

原创 prim 算法优化

prim 算法优化：普通法：int nearvex[Maxn], lowest[Maxn], road[Maxn][Maxn], n; int prim(int u) //从u出发构造最小生成树，共n个点{ int i, j, k, min, cost=0; for(i=0;i<n;i++){//顶点下标从0开始 lowest[i]=road[u][i]; /

2015-11-13 15:38:17 790

原创 ZOJ--1586--QS Network

QS NetworkCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmitStatus Practice ZOJ 1586 Appoint description:S

2015-11-13 15:17:08 503

原创 POJ--2421--Constructing Roads

Constructing RoadsCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice POJ 2421 Appoint descr

2015-11-13 14:48:44 491

原创 POJ--1251--Jungle Roads

Jungle RoadsCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice POJ 1251 Description

2015-11-13 14:27:17 462

原创 POJ--1679--The Unique MST

The Unique MSTCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice POJ 1679 Description

2015-11-13 13:36:53 487