zxiaopp-CSDN博客

原创 215. Kth Largest Element in an Array[堆|快排]

【代码】215. Kth Largest Element in an Array[堆|快排]

2022-12-22 17:17:56 535 2

原创 2. Add Two Numbers

【代码】2. Add Two Numbers。

2022-09-27 23:42:07 150

原创 POJ1321 棋盘问题（DFS）

棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29625 Accepted: 14690Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对

2015-11-14 16:12:30 550

原创 POJ2488 A Knight's Journey(DFS)

A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 36767 Accepted: 12489DescriptionBackground The knight is getting bored of seeing the s

2015-11-14 10:59:19 403

原创 POJ 2080Calendar （求日期水题）

CalendarTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 12413 Accepted: 4512DescriptionA calendar is a system for measuring time, from hours and minut

2015-11-11 23:31:54 1430 1

原创博弈

一、【巴什博弈】其游戏规则是这样的:有一堆n个石子，两个足够聪明的人玩，每个人可以去1～m个石子，取到最后一个石子为胜。比如 n=7 ,m =3那么先手必胜，过程大概如下，先手只需拿3个，那么留给后者就剩4个，后者不能一次拿完，又不能不拿，所以先手必胜所以只要满足n%(m+1) != 0 先手必胜，先手可以这么做：每次取都剩下（m+1）的整数倍，知道最后还剩一个m

2015-11-08 23:15:53 444

原创 POJ3292Semi-prime H-numbers(筛选法)

Semi-prime H-numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8250 Accepted: 3569DescriptionThis problem is based on an exercise of David Hilb

2015-11-08 21:07:37 650

原创 POJ 1270Following Orders(拓扑+DFS）

Following OrdersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4348 Accepted: 1751DescriptionOrder is an important concept in mathematics and in comp

2015-11-07 16:52:47 454

原创 POJ1840(hash)

DescriptionConsider equations having the following form: a1x13+ a2x23+ a3x33+ a4x43+ a5x53=0The coefficients are given integers from the interval [-50,50]. It is consider a solution a syst

2015-11-05 16:15:40 534

原创 POJ2503Babelfish(MAP+字典树)

BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 37423 Accepted: 15967DescriptionYou have just moved from Waterloo to a big city. The people h

2015-11-05 11:18:03 531

原创 POJ2418 Hardwood Species（二叉搜索树+字典树+MAP）

Hardwood SpeciesTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 21179 Accepted: 8304DescriptionHardwoods are the botanical group of trees that have b

2015-11-03 19:05:55 741

原创 Linux命令（持续更新）

命令格式：命令【-选项】【参数】lsls -a (a = all)把隐藏文件显现ls -l 或 ls -lh (可以把l当成long）显示文件的详细信息，h的文件大小单位kls -ld 指定目录下的详细信息mkdirmkdir -p temp/a/b 创建第二个文件不存在的，a不存在cd cd . 当前路径cd .. 返回上一层pwd 显示绝对路径

2015-11-02 23:48:32 432

原创 POJ 3253 Fence Repair（哈夫曼树）

Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 33710 Accepted: 10845DescriptionFarmer John wants to repair a small length of the fence

2015-10-29 23:50:18 443

原创 ZOJ 2243 Binary Search Heap Construction笛卡尔树（二叉搜索+堆）

Binary Search Heap ConstructionTime Limit: 5 Seconds Memory Limit: 32768 KBRead the statement of problem G for the definitions concerning trees. In the following we define the basic

2015-10-29 23:41:30 523

原创 ZOJ 2724 Windows Message Queue（二叉堆||优先队列）

Windows Message QueueTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 2724Appoint description: System Crawler (2015-10-27)

2015-10-27 19:42:37 420

原创 POJ 1577 Falling leaves （二叉树的构造）

Falling LeavesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4329 Accepted: 2387Description Figure 1Figure 1 shows a graphical representation

2015-10-27 14:20:28 715

原创 POJ 2255 Tree Recovery（先序中序求后序）

Tree RecoveryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12857 Accepted: 8027DescriptionLittle Valentine liked playing with binary trees very much

2015-10-27 14:11:41 379

原创 ZOj 1141 Closest Common Ancestors（LCA)

Closest Common AncestorsTime Limit:10000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 1141Appoint description: System Crawler (201

2015-10-24 20:26:55 347

原创 POJ 2004 Hire and Fire(树+好题)

Hire and FireTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 2355 Accepted: 675DescriptionIn this problem, you are asked to keep track of the hierarch

2015-10-24 16:04:19 482

原创 POJ 1703 Find them, Catch them（带权并查集）

Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37383 Accepted: 11528DescriptionThe police office in Tadu City decides to say end

2015-10-23 16:19:25 268

原创 poj 2499 binary tree (平衡二叉树)

DescriptionBackground Binary trees are a common data structure in computer science. In this problem we will look at an infinite binary tree where the nodes contain a pair of integers. The tree

2015-10-22 20:07:07 425

原创 POJ 3437 Tree Grafting(二叉树高度)

Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1677 Accepted: 718DescriptionTrees have many applications in computer science. Perhaps

2015-10-22 19:43:17 503

原创 POJ 1182 食物链带权并查集

转载 http://blog.csdn.net/c0de4fun/article/details/7318642/#comments#include #include #include #include //#define INPUT/** Problem:1182 - 食物链，NOI2001 Begin Time:4th/Mar/2012 1:00 p.

2015-10-22 15:33:52 335

原创 UVA 10539 Almost Prime Numbers

Almost prime numbers are the non-prime numbers which are divisible by only a single prime number.In this problem your job is to write a program which ﬁnds out the number of almost prime numbers

2015-10-20 14:45:03 541

原创 UVA 10391 Compound Words

You are to ﬁnd all the two-word compound words in a dictionary. A two-word compound word is aword in the dictionary that is the concatenation of exactly two other words in the dictionary.Input

2015-10-20 11:35:08 523

原创 POJ 1611 The Suspects

The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 28444 Accepted: 13854DescriptionSevere acute respiratory syndrome (SARS), an atypical pneu

2015-10-20 10:40:23 242

原创 BestCoder Round #60 5505GT and numbers

Accepts: 47Submissions: 939Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionYou are given two numbers NNN and MMM

2015-10-18 17:15:44 339

原创 GT and sequence 5504GT and sequence

GT and numbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 301 Accepted Submission(s): 85Problem DescriptionYou are given

2015-10-18 17:00:41 394

原创 Codeforces Round #326 (Div. 2)

B. Duff in Lovetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDuff is in love with lovely numbers! A positi

2015-10-16 20:20:32 399

原创 Codeforces Round #326 A. Duff and Meat

A. Duff and Meattime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDuff is addicted to meat! Malek wants

2015-10-16 20:10:32 392

原创 ZOJ 3911 Prime Query

Time Limit: 1 Second Memory Limit: 196608 KBYou are given a simple task. Given a sequence A[i] with N numbers. You have to perform Q operations on the given sequence.Here are the

2015-10-14 18:32:48 319

原创 HD 5500Reorder the Books

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 331 Accepted Submission(s): 229Problem Descriptiondxy has a collection of

2015-10-11 21:17:57 382

原创 King's Sanctuary

Time Limit: 1000msMemory Limit: 65535KBThis problem will be judged on UESTC. Original ID: 9364-bit integer IO format: %lld Java class name: MainPrev Submit Status St

2015-10-07 17:25:28 368

原创区间相关问题总结

一、选择不相交区间数轴上有n个区间[ai,bi]，要求选择尽量多个区间，使得这些区间两两没有公共点贪心策略：按照b1证明：我们对a1,a2……的关系分以下几种情况考虑：1、a1>a2。此时区间2包含区间1。这种情况下显然不会选择区间2，因为选择区间1会留下更多的剩余空间。不仅区间2如此，以后所有区间中只要有一个 i

2015-10-01 11:22:36 1873

原创并查集求集合的个数

以前求并查集都不太在乎每个数的根节点，其实并查集最好的就是这个作用。只需要改进一点就行void join(int x,int y){ int fx=find(x); int fy=find(y); if(fx!=fy) { if(fx>fy) pre[fx]=fy; else pr

2015-09-22 23:37:13 2158

原创 HD 5455 FangFang

Fang FangTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 552 Accepted Submission(s): 240Problem DescriptionFang Fang says she

2015-09-20 18:33:18 292

原创 hiho一下第六十二周Browser Caching

时间限制:10000ms单点时限:1000ms内存限制:256MB描述When you browse the Internet, browser usually caches some documents to reduce the time cost of fetching them from remote servers. Let

2015-09-10 15:55:14 421

原创 1599 - Ideal Path

New labyrinth attraction is open in New Lostland amusement park. The labyrinth consists of n rooms connected by m passages. Each passage is colored into some color ci. Visitors of the labyrinth

2015-09-07 17:08:27 461

原创 HD 5428 The Factor

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1052 Accepted Submission(s): 346Problem DescriptionThere is a sequence of $

2015-09-06 20:04:54 362

原创 #1078 : 线段树的区间修改

时间限制:10000ms单点时限:1000ms内存限制:256MB描述对于小Ho表现出的对线段树的理解，小Hi表示挺满意的，但是满意就够了么？于是小Hi将问题改了改，又出给了小Ho：假设货架上从左到右摆放了N种商品，并且依次标号为1到N，其中标号为i的商品的价格为Pi。小Hi的每次操作分为两种可能，第一种是修改价格——小H

2015-09-05 10:49:18 751

CommonBeanUtils

DiskFileItemFactory需要的jar包

java 点一下按钮就能画一个图形，怎么弄呢