摘要：
给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积. Input输入数据的第一行是一个正整数T(1<=T<=100),代表测试数据的数量.每个测试数据的第一行是一个正整数N(1<=N<=1000),代表矩形的数量,然后是N行数据,每一行包含四个浮点数,代表平面上的一个矩形的左上角坐标和右下 阅读全文
摘要：
Description David the Great has just become the king of a desert country. To win the respect of his people, he decided to build channels all over his 阅读全文
摘要：
约会安排 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2705 Accepted Submission(s): 768 Problem Des 阅读全文
摘要：
Transformation Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 65535/65536 K (Java/Others)Total Submission(s): 7144 Accepted Submission(s): 1811 阅读全文
摘要：
Sightseeing Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10004 Accepted: 3523 Description Tour operator Your Personal Holiday organises 阅读全文
摘要：
E. Border time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Astronaut Natasha arrived on Ma 阅读全文
摘要：
C. Line time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A line on the plane is described 阅读全文
摘要：
Problem Description In a galaxy far, far away, there are two integer sequence a and b of length n.b is a static permutation of 1 to n. Initially a is 阅读全文
摘要：
给出一个有n个元素的数组，有以下两种操作：Q x y，求出区间[x,y)内不同元素的个数， M x y，把第x个元素的值修改为y。注意题目中的下标是从0开始的 这题超级超级坑 妈的一个水题找了几个小时的BUG 这样AC 这样WA 吃一堑长一智 妈的毒瘤啊 1 #include <bits/stdc+ 阅读全文
摘要：
Given a sequence of n numbers a1, a2, ..., an and a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query (i, j), you have 阅读全文