Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

此题离散化根本用不着排序，浪费时间呢，看我的离散化

Posted by 1106100214 at 2012-07-23 06:56:35 on Problem 2528 
while (i--) {
	scanf("%d%d",&poster[i].start,&poster[i].end);
	dismaping[poster[i].start-1] = dismaping[poster[i].end] = 2;
}
for (i = 1; i < 10000005; i++) {
	dismaping[i] += dismaping[i-1];
}
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator