2015年01月_一种坚持__

原创 POJ 3295 Tautology（构造法）

TautologyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10004 Accepted: 3794DescriptionWFF 'N PROOF is a logic game played with dice. Each die has six

2015-01-31 10:52:19 501

转载 100个动规方程

100个动规方程 1. 资源问题1-----机器分配问题F[I,j]:=max(f[i-1,k]+w[i,j-k]) 2. 资源问题2------01背包问题F[I,j]:=max(f[i-1,j-v]+w,f[i-1,j]); 3. 线性动态规划1-----朴素最长非降子序

2015-01-30 21:39:36 540

原创 POJ 2337 Catenyms(有向图欧拉路径判定&&打印)

CatenymsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9905 Accepted: 2588DescriptionA catenym is a pair of words separated by a period such that the l

2015-01-30 20:40:04 696

原创 POJ 1041 John's trip（无向图欧拉回路 && 路径）

John's tripTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7433 Accepted: 2465 Special JudgeDescriptionLittle Johnny has got a new car. He decided t

2015-01-30 09:13:55 560

原创 HDU 1671 Phone List(字典树)

Phone ListTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11498 Accepted Submission(s): 3921Problem DescriptionGiven a list o

2015-01-29 20:43:16 455

原创 POJ 1386 Play on Words(有向图欧拉路径并查集判定)

Play on WordsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10068 Accepted: 3452DescriptionSome of the secret doors contain a very interesting word puz

2015-01-29 14:24:48 578

转载欧拉回路，欧拉路

http://www.cnblogs.com/pandy/archive/2009/05/07/1452209.htmlhttp://bchine.com/mjmjmtl/?p=241参考以上：判断欧拉路，欧拉回路：注意图联通，可以DFS或者并查集一．无向图欧拉回路：每个顶点度数都是偶数欧拉路：所有点度数为

2015-01-29 10:30:36 500

原创 POJ 2230 Watchcow（欧拉回路）

WatchcowTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 6180 Accepted: 2670 Special JudgeDescriptionBessie's been appointed the new watch-cow for th

2015-01-29 09:36:05 494

转载 ACM题集以及各种总结大全！

ACM题集以及各种总结大全！虽然退役了，但是整理一下，供小弟小妹们以后切题方便一些，但由于近来考试太多，顾退役总结延迟一段时间再写！先写一下各种分类和题集，欢迎各位大牛路过指正。一.ACM入门关于ACM 百度百科连接杭州电子科技大学(hdu)ACM题目连接

2015-01-29 08:27:31 523

原创 Codeforces Round #288 (Div. 2) C. Anya and Ghosts

C. Anya and Ghoststime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnya loves to watch horror movies. In th

2015-01-28 15:04:41 531

原创 Codeforces Round #288 (Div. 2) B. Anton and currency you all know

B. Anton and currency you all knowtime limit per test0.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland, 2016. The exc

2015-01-28 14:45:00 532

原创 Codeforces Round #288 (Div. 2) A. Pasha and Pixels

A. Pasha and Pixelstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPasha loves his phone and also putting

2015-01-28 14:38:39 491

原创 POJ 2531 Network Saboteur（DFS分两点集求最大权）

Network SaboteurTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9522 Accepted: 4524DescriptionA university network is composed of N computers. System ad

2015-01-27 15:35:15 620

原创 POJ 1035 Spell checker（字符串处理）

Spell checkerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20082 Accepted: 7366DescriptionYou, as a member of a development team for a new spell check

2015-01-27 11:01:43 480

转载编程中无穷大常量的设定技巧

如果问题中各数据的范围明确，那么无穷大的设定不是问题，在不明确的情况下，很多程序员都取0x7fffffff作为无穷大，因为这是32-bit int的最大值。如果这个无穷大只用于一般的比较（比如求最小值时min变量的初值），那么0x7fffffff确实是一个完美的选择，但是在更多的情况下，0x7fffffff并不是一个好的选择。很多时候我们并不只是单纯拿无穷大来作比较，而是会运算后再做比较，

2015-01-27 09:03:03 514

原创 POJ 3009 Curling 2.0（DFS）

Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12552 Accepted: 5288DescriptionOn Planet MM-21, after their Olympic games this year, curling

2015-01-27 09:01:15 482

原创 POJ Goldbach's Conjecture（素数筛~欧拉筛法）

Goldbach's ConjectureTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 39018 Accepted: 14944DescriptionIn 1742, Christian Goldbach, a German amateur mathe

2015-01-26 19:01:06 723 1

原创 POJ 2632 Crashing Robots（模拟）

Crashing RobotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8072 Accepted: 3505DescriptionIn a modernized warehouse, robots are used to fetch the goo

2015-01-26 16:32:50 483

原创 POJ 1017 Packets（构造模拟）

PacketsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 45405 Accepted: 15338DescriptionA factory produces products packed in square packets of the same

2015-01-26 11:23:44 557

原创 POJ 2528 Mayor's posters(线段树离散化)

Mayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 45707 Accepted: 13243DescriptionThe citizens of Bytetown, AB, could not stand that the ca

2015-01-25 20:01:42 504

原创 POJ 3468 A Simple Problem with Integers(子区间更新维护)

A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 67497 Accepted: 20813Case Time Limit: 2000MSDescriptionYou have N i

2015-01-24 11:12:08 447

原创 POJ 2828 Buy Tickets(线段树单点更新维护)

Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 14304 Accepted: 7157DescriptionRailway tickets were difficult to buy around the Lunar New Yea

2015-01-23 11:18:58 512

原创 POJ 1887 Testing the CATCHER（最长递减子序列）

Testing the CATCHERTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15313 Accepted: 5633DescriptionA military contractor for the Department of Defense ha

2015-01-22 15:43:45 454

原创 POJ 3267 The Cow Lexicon( DP~去掉最少字符)

The Cow LexiconTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8319 Accepted: 3931DescriptionFew know that the cows have their own dictionary with W (1

2015-01-22 14:57:42 490

原创 POJ 1836 Alignment( LIS )

AlignmentTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13581 Accepted: 4369DescriptionIn the army, a platoon is composed by n soldiers. During the mor

2015-01-21 19:24:28 577

原创 POJ 1260 Pearls（DP）

PearlsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7545 Accepted: 3733DescriptionIn Pearlania everybody is fond of pearls. One company, called The Ro

2015-01-21 15:02:41 534

原创 POJ 3176 Cow Bowling（数字三角形求最值）

Cow BowlingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14397 Accepted: 9567DescriptionThe cows don't use actual bowling balls when they go bowling.

2015-01-21 09:48:05 552

原创 POJ 1080 Human Gene Functions(LCS变形)

Human Gene FunctionsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17443 Accepted: 9707DescriptionIt is well known that a human gene can be considered

2015-01-21 08:59:28 491

原创 POJ 1159 Palindrome（LCS~~回文）

PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 54092 Accepted: 18689DescriptionA palindrome is a symmetrical string, that is, a string read i

2015-01-20 19:54:22 481

原创 uva 10534 Wavio Sequence (最大递增和递减序列 n*logn)

Wavio Sequence Input: Standard InputOutput: Standard OutputTime Limit: 2 Seconds Wavio is a sequence of integers. It has some interesting properties.· Wavio is of odd length i.e. L = 2*n

2015-01-20 15:48:57 616

原创 POJ 1088 滑雪（DP）

滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 79201 Accepted: 29452DescriptionMichael喜欢滑雪百这并不奇怪，因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等

2015-01-20 10:27:27 570

转载计算机专业毕业后大致的工作方向

计算机专业毕业后大致的工作方向是软、硬、网、图四大类 if 你选择作技术，then 从现在开始，牢记：天道酬勤！！！ if 你选择软件技术 then 每天都要用大量的时间学习高级语言，绝对不能仅限于学校的安排。优秀的程序员都是大学阶段就已经自学得非常深入了。 if you选择网络技术，那么你就多多从网上阅读有关资料 if you 选择营销类，那么，你只要将老师教授的学好就o

2015-01-19 20:48:52 907

原创 POJ 1631 Bridging signals(最长上升子序列 n*logn && POJ 3903)

Bridging signalsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11025 Accepted: 6043Description'Oh no, they've done it again', cries the chief designer

2015-01-19 20:43:37 578

转载最长上升子序列nlogn算法(poj 2533 && SDUT 1299)

这题目是经典的DP题目，也可叫作LIS（Longest Increasing Subsequence）最长上升子序列或者最长不下降子序列。很基础的题目，有两种算法，复杂度分别为O(n*logn)和O(n^2) 。A.O(n^2)算法分析如下：（a[1]...a[n] 存的都是输入的数） 1、对于a[n]来说，由于它是最后一个数，所以当从a[n]开始查找时，只存在长度为

2015-01-19 20:19:27 729

原创 SDUT 2080 最长公共子序列问题 (同uva10100 && POJ 1458 &&　HDU 1159)

最长公共子序列问题Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^题目描述给定两个序列X=输入输入数据有多组，每组有两行，每行为一个长度不超过500的字符串（输入全是大写英文字母（A,Z）），表示序列X和Y。输出每组输出一行，表示所求得的最长公共子序列的

2015-01-19 16:22:37 755

原创 uva 10100 Longest Match（最长公共子序列）

Longest MatchInput: standard inputOutput: standard outputA newly opened detective agency is struggling with their limited intelligence to find out a secret information passing technique among

2015-01-19 15:53:50 1516

转载 cin.getline()与getline()

C++中有两个getline函数，这两个函数分别定义在不同的头文件中。1.getline()是定义在中的一个行数，用于输入一行string，以enter结束。函数原型：getline(cin,str);cin:istream类的输入流对象str:待输入的string对象 example 1:[cpp] view

2015-01-19 14:05:40 350

原创 uva 147 Dollars(完全背包)

DollarsTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription Dollars New Zealand currency consis

2015-01-19 10:31:08 505

转载按位与、或、异或等运算方法

目录(?)[+]按位与运算符（&）参加运算的两个数据，按二进制位进行“与”运算。运算规则：0&0=0; 0&1=0; 1&0=0; 1&1=1; 即：两位同时为“1”，结果才为“1”，否则为0例如：3&5 即 0000 0011 & 0000 0101 = 0000 0001 因此，3&5的值得1。

2015-01-18 14:13:00 468

原创 SDUT 1591 交叉排序

交叉排序Time Limit: 1000MS Memory limit: 32768K题目描述输入N个数，把所有奇数位置上的数从小到大排序，把偶数位置上的数从大到小排序。输入输入的第一行是一个正整数N(2第二行是N个用空格隔开的整数。输出输出只有一行N个数，是按要求排序后的序列，用空格隔开。示例输入

2015-01-17 20:13:45 710

go-ipfs_v0.4.15_windows-amd64

Wampserver2.4-x64

空空如也