wonderzy-CSDN博客

原创 poj2356 Find a multiple(鸽巢原理)

Find a multiple Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6172 Accepted: 2689 Special Judge Description The input contains N natural (i.e. positi

2014-10-20 16:53:20 581

原创 hdu4691 Front compression(后缀数组)

Front compression Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others) Total Submission(s): 1339 Accepted Submission(s): 496 Problem Description Front compression

2014-10-09 15:01:18 828

原创 hdu4429 Split the Rectangle(LCA)

Split the Rectangle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 321 Accepted Submission(s): 98 Problem Description Alice com

2014-10-07 18:52:15 726

原创 hdu5017 Ellipsoid（模拟退火）

Ellipsoid Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1225 Accepted Submission(s): 446 Special Judge Problem Description Given a

2014-10-06 20:18:03 826

原创 hdu5008 Boring String Problem(后缀数组)

Boring String Problem Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 927 Accepted Submission(s): 263 Problem Description In this pr

2014-10-06 17:30:08 783

原创 hdu5009 Paint Pearls(DP+STL优化)

Paint Pearls Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2089 Accepted Submission(s): 687 Problem Description Lee has a string o

2014-10-06 17:26:31 617

原创 AOJ1127 Non Absorbing DFA（自动机+DP）from ASC2

A - Non Absorbing DFA Time Limit: 10000/5000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others) SubmitStatus Problem Description In the theory of compilers and languages fini

2014-10-03 18:44:15 961

原创 uva11488 Hyper Prefix Sets（Trie树）

H Hyper Prefix Sets Prefix goodness of a set string is length of longest common prefix*number of strings in the set. For example the prefix goodness of the set {000,001,0011} is

2014-10-01 21:44:44 570

原创 hdu5044（神姿势+树链剖分）

Tree Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 533 Accepted Submission(s): 106 Problem Description You are given a tree (

2014-09-27 23:03:18 744

原创 hdu5029 Relief grain (树链剖分)

Relief grain Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others) Total Submission(s): 686 Accepted Submission(s): 163 Problem Description The soil is cracking u

2014-09-26 20:23:52 752

原创 hdu4057 Rescue the Rabbit（AC自动机+DP）

Rescue the Rabbit Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1412 Accepted Submission(s): 403 Problem Description Dr. X is a biol

2014-09-18 14:25:28 886

原创 hdu4758 Walk Through Squares (AC自动机+DP)

Walk Through Squares Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 944 Accepted Submission(s): 277 Problem Description On the beam

2014-09-18 14:19:09 814

原创 uva10085 The most distant state(BFS)

Problem A The Most Distant State Input: standard input Output: standard output The 8-puzzle is a square tray in which eight square tiles are placed. The remaining ninth square is uncovered. Eac

2014-09-12 15:53:24 797

原创 UVA 10422 Knights in FEN（BFS）

Problem D Knights in FEN Input: standard input Output: standard output Time Limit: 10 seconds There are black and white knights on a 5 by 5 chessboard. There are twelve of each color, and ther

2014-09-11 21:34:53 826

原创 10603 Fill (BFS)

Problem D FILL There are three jugs with a volume of a, b and c liters. (a, b, and c are positive integers not greater than 200). The first and the second jug are initially empty, while the thi

2014-09-11 00:11:15 621

原创 ZOJ 3811 Untrusted Patrol(BFS)

Untrusted Patrol Time Limit: 3 Seconds Memory Limit: 65536 KB Edward is a rich man. He owns a large factory for health drink production. As a matter of course, there is a large warehous

2014-09-10 00:13:42 1089

原创 ZOJ 3813 Alternating Sum 树状数组

Alternating Sum Time Limit: 2 Seconds Memory Limit: 65536 KB There is a digit string S with infinite length. In addition, S is periodic and it can be formed by concatenating infinite re

2014-09-09 23:37:02 1037 1

原创 hdu4044 GeoDefense 树形dp

GeoDefense Time Limit: 12000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 686 Accepted Submission(s): 275 Problem Description Tower defense is

2014-09-07 00:45:40 560

原创 hdu4295 4 substrings problem 状压dp

4 substrings problem Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 583 Accepted Submission(s): 180 Problem Description 　　One d

2014-09-07 00:37:53 513

原创 ZOJ3800 GCD+离线线段树

Calculation Time Limit: 5 Seconds Memory Limit: 262144 KB You are given a sequence {A0, A1, ..., AN-1} and an integer set called GS. Defined a function called G(L, R) on A, where G(L, R

2014-09-07 00:17:51 979

原创 poj2486 Apple Tree 树形dp

Apple Tree Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7260 Accepted: 2435 Description Wshxzt is a lovely girl. She likes apple very much. One day HX t

2014-09-07 00:10:38 805

原创 hdu 4294 Multiple BFS

Multiple Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 954 Accepted Submission(s): 230 Problem Description 　　Given a positive

2014-09-02 20:23:57 548

原创 zoj3798 Abs Problem 水题

Abs Problem Time Limit: 2 Seconds Memory Limit: 65536 KB Special Judge Alice and Bob is playing a game, and this time the game is all about the absolute value! Alice has N diffe

2014-08-29 15:57:48 514

原创 zoj3805 Machine DP

Machine Time Limit: 2 Seconds Memory Limit: 65536 KB In a typical assembly line, machines are connected one by one. The first machine's output product will be the second machine's raw m

2014-08-29 15:52:23 489

原创 zoj3802 Easy 2048 Again 状压dp

Easy 2048 Again Time Limit: 2 Seconds Memory Limit: 65536 KB Dark_sun knows that on a single-track road (which means once he passed this area, he cannot come back again), there are some

2014-08-29 15:37:27 682

原创 CF 461B Appleman and Tree 树形dp

B. Appleman and Tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Appleman has a tree with n vertices. S

2014-08-27 18:15:27 607

原创 SRM627 div2 1000pt DP

Problem Statement The pseudocode shown below is an implementation of BubbleSort. Note that the array A used in the implementation is 0-based. That is, elements of A have indices 0 through Le

2014-08-22 19:42:48 692

原创 hdu4862 Jump 费用流

Jump Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 847 Accepted Submission(s): 346 Problem Description There are n*m grids, ea

2014-08-21 20:09:24 506

原创 poj2104||hdu2665 归并树|划分树

#include #include #include #include #include #define maxn 100010 using namespace std; int n,m; int s[maxn]; struct tree{ int l,r; }a[maxn*3]; int lsum[20][maxn],t[20][maxn]; void build(int l,

2014-06-16 20:25:58 701

WONDERZY