2015年11月_梧桐下的四叶草

12月 11月 10月 09月 08月 07月 06月 05月 04月 03月 02月 01月

原创油菜花王国（并查集）

油菜花王国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 19:16:42 464

原创搬砖（规律题）

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

2015-11-29 16:51:16 1234

原创 BestCoder Round #64 (div.2)Sum(最大子序列)好题

Sum Accepts: 322 Submissions: 940 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述给n个数{A}_{1},{A}_{2}....{A}_{n}A1,A2....An,你可

2015-11-29 00:32:59 374

原创 BestCoder Round #64 (div.2)Numbers（高精度）

Numbers Accepts: 480 Submissions: 1518 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述给一个数N，如果N是2、3或者5的倍数，输出"YES",否则输出"NO".输入描述输入有

2015-11-28 23:35:04 325

转载 RMQ算法分析

转载自：大神养成中.....RMQ算法，是一个快速求区间最值的离线算法，预处理时间复杂度O（n*log(n)），查询O(1)，所以是一个很快速的算法，当然这个问题用线段树同样能够解决。问题：给出n个数ai，让你快速查询某个区间的的最值。算法分类：DP+位运算算法分析：这个算法就是基于DP和位运算符，我们用dp【i】【j

2015-11-26 12:08:59 272

原创 Approximating a Constant Range（RMQ）

B. Approximating a Constant Rangetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Xellos was doing a p

2015-11-26 11:40:28 364

原创 HDU 1800-Flying to the Mars（trie树）

E - Flying to the MarsTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1800Appoint description: System Crawler (2015-11-20)

2015-11-23 23:00:49 312

原创 HDU 1247-Hat’s Words（trie树）

D - Hat’s WordsTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1247Appoint description: System Crawler (2015-11-23)Descrip

2015-11-23 22:53:50 403

原创大白-Dijksta模板

这个模板更加直观。#include#include#include#include#include#include#includetypedef long long ll;using namespace std;#define T 555#define maxn 123#define inf 0x3f3f3f3fstruct Edge{ int from,to

2015-11-22 16:32:35 371

原创 POJ 1125-Stockbroker Grapevine(floyd)

E - Stockbroker GrapevineTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1125Appoint description: System Crawler (2015-11-18)

2015-11-22 15:18:01 451

原创 URAL 1225-Flags（规律递推）

A - ATime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice URAL 1225DescriptionOn the Day of the Flag of Russia a shop-owner decided

2015-11-21 23:47:41 616

原创 Patrick and Shopping（模拟）

A. Patrick and ShoppingToday Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs to buy some goodies in two stores located near his house. There

2015-11-21 10:05:48 376

原创 POJ 2485-Highways（并查集）

H - HighwaysTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2485Appoint description: System Crawler (2015-11-15)Descriptio

2015-11-20 23:52:35 308

原创 ZOJ 3631-Watashi's BG（bfs+循环队列）

A - Watashi's BGTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3631Appoint description: System Crawler (2015-11-19)Descript

2015-11-20 13:18:24 378

原创 HDU 2181-哈密顿绕行世界问题（裸dfs）

E - 哈密顿绕行世界问题Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2181Appoint description: System Crawler (2015-11-14)Descripti

2015-11-19 18:11:28 294

原创 A计划（bfs）

F - A计划Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2102Appoint description: System Crawler (2015-11-15)Description

2015-11-19 16:21:41 483

原创用函数做形参

void vis(int r){}void ff(void vis(int r)){}int main(){ ff(vis);//不用写实参在里面 return 0;}

2015-11-18 17:53:47 414

原创 HDU 1429-胜利大逃亡(续)

A - 胜利大逃亡(续)Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1429Appoint description: System Crawler (2015-11-09)Description

2015-11-16 22:54:51 381

原创 Codeforces Round #331 (Div. 2)-Wilbur and Array（贪心模拟）

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

2015-11-16 09:21:23 399

原创 Codeforces Round #331 (Div. 2)-Wilbur and Swimming Pool（模拟）

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

2015-11-16 09:16:14 442

原创 FOJ有奖月赛-2015年11月-Problem F 攻占计划

Problem F 攻占计划Accept: 113 Submit: 232Time Limit: 1000 mSec Memory Limit : 131072 KB Problem DescriptionA国和B国正在进行一场战争，A国有n座城市，这些城市被m条有向道路相连，这些道路不会形成环路。其中有一部分城市比较特殊，其拥有粮仓，拥有粮仓的城市不能

2015-11-15 18:02:32 729

原创 FOJ有奖月赛-2015年11月-Problem B 函数求解

Problem B 函数求解Accept: 171 Submit: 540Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description给出n，求f(n)。 Input第一行一个正整数T，表示数据组数。接下来T行，每行一个正整数n。 T Output对于每组数据，输

2015-11-15 17:52:36 520

原创 FOJ有奖月赛-2015年11月-据说题目很水

Problem A 据说题目很水Accept: 113 Submit: 445Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionSunday最近对图论特别感兴趣，什么欧拉回路什么哈密顿回路，又是环又是树。在看完一本书后，他对自己特别有信心，便找到大牛牛犇犇，希望他出一题来考考

2015-11-15 17:49:32 728

原创 BestCoder Round #62 (div.2)-Clarke and baton（二分搜索）

Clarke and baton Accepts: 1 Submissions: 126 Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)问题描述克拉克是一名人格分裂患者。某一天，克拉克fork出了nn个自己，序号从11

2015-11-15 00:38:01 749

原创 BestCoder Round #62 (div.2)-Clarke and five-pointed star（几何）

Clarke and five-pointed star Accepts: 237 Submissions: 591 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述克拉克是一名人格分裂患者。某一天克拉克分裂为一个几何学习

2015-11-14 21:54:32 458

原创 BestCoder Round #62 (div.2)-Clarke and food（模拟）

Clarke and food Accepts: 353 Submissions: 962 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述克拉克是一名人格分裂患者。某一天，克拉克变成了一个厨师，在采购食品。克拉克一

2015-11-14 21:46:05 3779

原创 codeforces - 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

2015-11-14 11:09:16 573

原创 codeforces - Tricky Sum（模拟）

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

2015-11-14 11:03:17 451

原创 POJ 1679-The Unique MST（判断最小生成树的唯一性）

B - The Unique MSTTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1679Appoint description: System Crawler (2015-11-12)Desc

2015-11-13 13:43:36 1518 2

原创 LITTLE SHOP OF FLOWERS（dp）

G - LITTLE SHOP OF FLOWERSTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1157Appoint description: System Crawler (2015-11-07)

2015-11-13 10:19:39 581

原创 POJ 3087-Shuffle'm Up（模拟题）

I - Shuffle'm UpTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3087Appoint description: System Crawler (2015-11-09)Descri

2015-11-12 18:19:03 404

原创 HDU 4578-Transformation（线段树）

J - TransformationTime Limit:8000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4578Appoint description: System Crawler (2015-11-11)Desc

2015-11-11 23:57:45 1079

原创 POJ 3278-Catch That Cow（bfs）

Catch That CowTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3278Appoint description: System Crawler (2015-11-09)Descript

2015-11-10 21:22:02 355

原创 CSU 1541- There is No Alternative（克鲁斯卡尔）

F - There is No AlternativeTime Limit:3000MS Memory Limit:262144KB 64bit IO Format:%lld & %lluSubmit Status Practice CSU 1541Description Input

2015-11-10 19:07:04 658

原创 codeforces-330-Pasha and Phone（容差定理）

B. Pasha and Phonetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPasha has recently bought a new phone jPa

2015-11-09 13:34:58 598

原创 POJ 2528-Mayor's posters（线段树+离散化）

C - Mayor's postersTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2528Appoint description: System Crawler (2015-11-05)Des

2015-11-08 23:26:39 360

原创 ZOJ 2972-Hurdles of 110m(背包dp)

H - Hurdles of 110mTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 2972DescriptionIn the year 2008, the 29th Olympic Games wi

2015-11-08 20:51:26 403

原创 Colorful Rainbows（计算几何）

C - Colorful RainbowsTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 2967DescriptionEvelyn likes drawing very much. Today, sh

2015-11-08 00:53:09 550

原创 Kinds of Fuwas（暴力+组合数学）

K - Kinds of FuwasTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 2975DescriptionIn the year 2008, the 29th Olympic Games wil

2015-11-07 19:31:30 756

原创 Give Me the Number(将字符串的值变为数)

G - Give Me the NumberTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 2971DescriptionNumbers in English are written down in t

2015-11-07 19:22:03 807