poj3067（二维偏序+树状数组）

最新推荐文章于 2025-04-23 15:46:21 发布

mumei314

最新推荐文章于 2025-04-23 15:46:21 发布

阅读量428

点赞数 1

分类专栏：树状数组文章标签：树状数组二维偏序逆序对

本文链接：https://blog.youkuaiyun.com/qq_43472263/article/details/103319901

版权

题目链接：http://poj.org/problem?id=3067

Description

Japan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M cities on the West coast (M <= 1000, N <= 1000). K superhighways will be build. Cities on each coast are numbered 1, 2, ... from North to South. Each superhighway is straight line and connects city on the East coast with city of the West coast. The funding for the construction is guaranteed by ACM. A major portion of the sum is determined by the number of crossings between superhighways. At most two superhighways cross at one location. Write a program that calculates the number of the crossings between superhighways.

Input

The input file starts with T - the number of test cases. Each test case starts with three n