swust_fangfangfang-CSDN博客

原创 codeforces 631C Report

C. Reporttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEach month Blake gets the report containing main economic i

2016-03-10 20:09:45 434

原创 HDU 5636 Shortest Path floyd应用

Shortest PathTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 643 Accepted Submission(s): 209Problem DescriptionThere is a p

2016-03-06 16:41:01 413

原创 codeforces 600A Extract Numbers 模拟

A. Extract Numberstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given string s. Let's call word

2016-03-03 20:42:17 575

原创 POJ 1470 Closest Common Ancestors LCA_Tarjan

Closest Common AncestorsTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 18141 Accepted: 5807DescriptionWrite a program that takes as input a rooted tree

2016-02-28 18:02:09 390

原创 POJ 1330 Nearest Common Ancestors LCA_Tarjan

Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23499 Accepted: 12268DescriptionA rooted tree is a well-known data structure in

2016-02-26 21:30:56 286

原创 HDU2586 How far away ？ LCA_Tarjan解法

How far away ？Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10580 Accepted Submission(s): 3851Problem DescriptionThere are

2016-02-26 15:55:39 798 1

原创 POJ 1151 Atlantis 线段树面积并

Atlantis Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 19878 Accepted: 7523 DescriptionThere are several ancient Greek texts that contain descriptions of the fabled island A

2016-01-30 17:07:41 361

原创 POJ 1185 炮兵阵地状压DP

炮兵阵地 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 22851 Accepted: 8837 Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用”H” 表示），也可能是平原（用”P”表示），如下图。在每一格平

2016-01-29 15:00:16 420

原创 HDU 3308 LCIS 线段树区间合并

LCISTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5853 Accepted Submission(s): 2540Problem DescriptionGiven n integers.Yo

2016-01-24 21:06:38 488

原创区间合并 POJ 3667 Hotel

Hotel Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 14755 Accepted: 6385 DescriptionThe cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and en

2016-01-23 09:54:04 335

原创线段树区间更新的理解 POJ 3468 A Simple Problem with Integers 线段树区间更新线段树区间更新的理解

A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072K Total Submissions: 84089 Accepted: 26030 Case Time Limit: 2000MS DescriptionYou have N integers, A1, A2, … , AN. Yo

2016-01-22 14:41:42 347

原创 HdU OJ 1107 武林一只巨大的模拟

武林Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3083 Accepted Submission(s): 819Problem Description 在一个有12行12列的方形的武林世界里，少林、武当和峨嵋三派的弟子们在为

2015-12-19 13:24:50 694

原创 CodeForces 375A Divisible by Seven

A. Divisible by SevenYou have number a, whose decimal representation quite luckily contains digits 1, 6, 8, 9. Rearrange the digits in its decimal representation so that the resulting number will be di

2015-12-14 16:39:08 591

原创 POJ 3213 PM3 矩阵乘法

PM3USTC has recently developed the Parallel Matrix Multiplication Machine – PM3, which is used for very large matrix multiplication.Given two matrices A and B, where A is an N × P matrix and B is a P ×

2015-12-11 19:43:09 707

原创 codeforces 599B Spongebob and Joke

B. Spongebob and Joketime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputWhile Patrick was gone shopping, Spongebob decided to play a little trick

2015-11-26 21:31:01 656

原创 UVA1511 Buy or Build 二进制枚举+最小生成树kruskal

World Wide Networks (WWN) is a leading company that operates large telecommunication networks. WWN would like to setup a new network in Borduria, a nice country that recently managed to get rid of it

2015-11-25 20:52:06 508

原创 Poj 352 UVA oj 1395 Slim Span 最小生成树应用

Slim Span Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 7147 Accepted: 3783 DescriptionGiven an undirected weighted graph G, you should find one of spanning trees specified as

2015-11-23 22:07:00 638

原创 HDU 4786 Fibonacci Tree kruskal最小生成树应用

Description 　　Coach Pang is interested in Fibonacci numbers while Uncle Yang wants him to do some research on Spanning Tree. So Coach Pang decides to solve the following problem: 　　Consider a bidire

2015-11-23 20:02:22 421

原创 HDUoj 3666 THE MATRIX PROBLEM 差分约束

Description You have been given a matrix C N*M, each element E of C N*M is positive and no more than 1000, The problem is that if there exist N numbers a1, a2, … an and M numbers b1, b2, …, bm, which

2015-11-22 21:00:52 404

原创 HDUoj 1384 Intervals 差分约束

IntervalsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem Description You are given n closed, integer intervals [ai, bi] and n integers c1, …, cn.Write a pro

2015-11-20 20:12:03 400

原创 Poj 1734 Sightseeing trip floyd最小环

Sightseeing trip Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5698 Accepted: 2203 Special Judge DescriptionThere is a travel agency in Adelton town on Zanzibar island. It

2015-11-18 21:21:23 379

原创 Zoj 2770 Burn the Linked Camp 差分约束

DescriptionIt is well known that, in the period of The Three Empires, Liu Bei, the emperor of the Shu Empire, was defeated by Lu Xun, a general of the Wu Empire. The defeat was due to Liu Bei’s wrong d

2015-11-13 15:06:14 482

原创 POJ 3259 Wormholes bellman-ford判负环

DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a t

2015-11-05 21:25:51 525

原创 POJ1062 昂贵的聘礼 dij

Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低要求。酋长说：”嗯，如果你能够替我弄到大祭司的皮袄，我可以只要8000金币。如果你能够弄来他的水晶球，那么只要5000金币就行了。”探险家就跑到大祭司那里，向他要求皮袄或水晶球，大祭司要他用金币来换，或者

2015-11-04 17:26:12 431

原创 CodeForces 483C Diverse Permutation

Diverse PermutationTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u DescriptionPermutationp is an ordered set of integers p1, p2, …, pn, consisting of n distinct pos

2015-09-26 17:03:26 779

原创 HDU 1203 I NEED A OFFER! 简单01背包问题

I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20643 Accepted Submission(s): 8240Problem Description Speakless很早就想出国，现在他已经考

2015-09-10 21:52:34 504

原创 HDU 1003 Max Sum 最大连续子序列和

Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem Description Given a sequence a[1],a[2],a[3]……a[n], your job is to calculate the max sum of a sub-seque

2015-09-10 21:33:56 435

原创 HDU OJ 1864 最大报销额 01背包

最大报销额Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description 现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书（A类）、文具（B类）、差旅（C类），要求每张发票的总额不得超过1000元，每张发票上，单项物品的价值不得超过600元。

2015-09-10 21:00:35 460

原创 HDUoj 1576 A/B 扩展欧几里德

A/BProblem Description 要求(A/B)%9973，但由于A很大，我们只给出n(n=A%9973)(我们给定的A必能被B整除，且gcd(B,9973) = 1)。Input 数据的第一行是一个T，表示有T组数据。每组数据有两个数n(0 <= n < 9973)和B(1 <= B <= 10^9)。Output 对应每组数据输出(A/B)%9973。Sample Inpu

2015-08-18 21:36:50 468

原创 Poj 1061青蛙的约会扩展欧几里德

青蛙的约会 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 98003 Accepted: 18546 Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事

2015-08-18 21:09:11 452

原创 Poj 1006 Biorhythms

Biorhythms Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 121668 Accepted: 38345 DescriptionSome people believe that there are three cycles in a person’s life that start the d

2015-08-18 20:53:41 340

原创 Poj 1152 An Easy Problem!

DescriptionHave you heard the fact “The base of every normal number system is 10” ? Of course, I am not talking about number systems like Stern Brockot Number System. This problem has nothing to do wit

2015-08-18 20:38:25 459

原创 POJ 1183 反正切函数的应用

Description反正切函数可展开成无穷级数，有如下公式 (其中0 <= x <= 1) 公式(1) 使用反正切函数计算PI是一种常用的方法。例如，最简单的计算PI的方法： PI=4arctan(1)=4(1-1/3+1/5-1/7+1/9-1/11+…) 公式(2) 然而，这种方法的效率很低，但我们可以根据角度和的正切函数公式： tan(a+b)=[tan(a)+tan(b)]/[1-tan(

2015-08-17 20:52:04 665

swust_fang