ZOJ Problem Set - 2283
"Then, I want to know whether you're a wise boy!"
"I have a great deal of lands. They're divided into N*M grids (N, M <= 1,000,000,000). When you are in (x, y), you may move into (x+1, y) or (x, y+1). I have P (P <= 100,000) treasures in the lands; each time, you can pick up anything you like."
"Now, I'll give you a map of my treasures; tell me, wise boy, how many times you need to pick up all the treasures?"
This problem contains multiple test cases.
Each test case begins with 3 integers N, M and P. then followed by P lines, each lines contains 2 numbers: x, y, representing the location of a treasure.
For each test case, output the minimum times I need.
7 7 7
Author: JIANG, Yanyan
Source: JIANG, Yanyan's Contest #2