ZhouRush

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=610 ZOJ Problem Set - 1610 Count the Colors Time Limit: 2 Seconds Memory Limit: 65536 KB Painting some colored segments on a line, some p

http://poj.org/problem?id=2777 Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 27806 Accepted: 8321 Description Chosen Problem Solving and Program design as an optio

http://acm.hdu.edu.cn/showproblem.php?pid=1394 Minimum Inversion Number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5005 Accepted Submission(

转载出处：http://www.matrix67.com/blog/archives/108 作者：Matrix67 什么是离散化？ Program Impossible | 2006-09-26 21:09| 31 Comments | 本文内容遵从CC版权协议 转载请注明出自matrix67.com 如果说今年这时候OIBH问得最多的问题是二分图，那么去年这时候问得最多的算是离散化

出处http://blog.csdn.net/liyang_hawk/article/details/6819090 作者liyang_hawk //线段树模板 struct line {int left,right;//左端点、右端点 int n;//记录这条线段出现了多少次，默认为0 }; struct line a[100]; int sum; //建立 void build(int s,i

: 4000MS Memory Limit: 65536K Total Submissions: 8472 Accepted: 4070 Description Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a l

http://poj.org/problem?id=2182 Lost Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7497 Accepted: 4785 Description N (2 <= N <= 8,000) cows have unique brands in the range

http://www.spoj.pl/problems/AE5B2/ SPOJ Problem Set (classical) 4310. Permutacja Problem code: AE5B2   You are given a sequence of positive integers a1, a2, . . . , an. We would like to order

http://poj.org/problem?id=2528 Mayor's posters Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 29016 Accepted: 8405 Description The citizens of Bytetown, AB, could not stand tha

http://acm.hdu.edu.cn/showproblem.php?pid=1698 Just a Hook Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9726 Accepted Submission(s): 4761 Pro

http://acm.hdu.edu.cn/showproblem.php?pid=1166 敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 19787 Accepted Submission(s): 8650 Problem D

http://poj.org/problem?id=3368 Frequent values Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10192 Accepted: 3733 Description You are given a sequence of n integers a1 , a2 ,

http://poj.org/problem?id=3368 Frequent values Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10191 Accepted: 3732 Description You are given a sequence of n integers a1 , a2 ,

http://poj.org/problem?id=1151 Atlantis Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 12467 Accepted: 4809 Description There are several ancient Greek texts that contain descr

原文地址：线段树的两种建树模型作者：飘羽逸狂线段树的两种建树模式: 第一种:端点形式 比如对区间[0,8]可以建立如下的线段树: [0,8] [0,4][4,8] [0,2][2,4][4,6][6,8] [0,1][1,2][2,3][3,4][4,5][5,6][6,7][7,8] 第二种:区间格形式 比如对区间[0,8]可以建立如下的线段树: [1,8] [1,4][5,8] [1,2][3

http://poj.org/problem?id=2155 Matrix Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 12894 Accepted: 4834 Description Given an N*N matrix A, whose elements are either 0 or 1. A

http://poj.org/problem?id=3468 A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 36023 Accepted: 10347 Case Time Limit: 2000MS Description You h

http://acm.hdu.edu.cn/showproblem.php?pid=4046 Panda Time Limit: 10000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1516 Accepted Submission(s): 511 Problem D