u012870383的专栏

I Hate ItTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 36235    Accepted Submission(s): 14257Problem Description很多学校流行一种比较的习惯。

线段树的简单应用，反素数的求解。

插队问题，要灵活运用线段树。

Help with IntervalsTime Limit: 6000MS Memory Limit: 131072KTotal Submissions: 10100 Accepted: 2425Case Time Limit: 2000MSDescriptionLogLoader, Inc. is a c

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

HotelTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 11788 Accepted: 5086DescriptionThe cows are journeying north to Thunder Bay in Canada to gain cultu

Coder RatingsProblem code: RATINGSome of the more elite (and not-so-elite) coders around take part in a certain unnamed programming contest. In said contest, there are multiple types

A Corrupt Mayor's Performance ArtTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 185    Accepted Submission(s): 94Problem Descript

BillboardTime Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10965    Accepted Submission(s): 4865Problem DescriptionAt the entranc

线段树成段更新，lazy标记的运用，位运算的运用。

Count the ColorsTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluDescriptionPainting some colored segments on a line, some previously painted se

Intervals 线段树+贪心这题可用差分约束法，也可用线段树+贪心的方法。第二种是这样子处理的，先将每个区间按有段坐标从小到大排序，然后每从左到右选取区间进行选点，选点要从该区间右端开始选。每次先看区间已选的点有多少，然后从右端开始把不够的补上。这个过程可用线段树维护，把效率提高了。通过这道题，我对线段树的使用有了进一步的理解。

Multiples of 3Problem code: MULTQ3There are N numbers a[0],a[1]..a[N - 1]. Initally all are 0. You have to perform two types of operations :1) Increase the numbers between in

"Ray, Pass me the dishes!"After doing Ray a great favor to collect sticks for Ray, Poor Neal becomes very hungry. In return for Neal's help, Ray makes a great dinner for Neal. When it is time for

Fast Matrix OperationsThere is a matrix containing at most 106 elements divided into r rows and c columns. Each element has a location (x,y) where 1<=x<=r,1<=y<=c. Initially, all the elements are

RMQ with Shifts In the traditional RMQ (Range Minimum Query) problem, we have a static array A. Then for eachquery (L, R) (LR), we report the minimum value among A[L],A[L + 1], ...,

SKYLINETime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %llu[Submit]  [Go Back]  [Status]  DescriptionThe skyline of Singapore as viewed from the M

Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10117    Accepted Submission(s): 6203Problem Description

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

敌兵布阵Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41008    Accepted Submission(s): 17331Problem DescriptionC国的死对头A国这段时间正在进行军事演

Problem FPermutationInput: Standard InputOutput: Standard Output Given N and K find the N’th permutation of the integers from 1 to K when those permutations are lexicographically ordered.  N

Just a HookTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16351    Accepted Submission(s): 8140Problem DescriptionIn the game o

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

题目 http://acm.whu.edu.cn/land/problem/detail?problem_id=1581题意：在一个三维空间里，有N*(K*N)*(K*K*N)个点，每个点有一定的值，然后有M个长方体，每个长方体以固定位置（（x1,y1,z1）（x2,y2,z2）为对角位置，其中(x1code:#include #include#includeusing namesp