Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int* sort(int* x, int n)
- {
- for (int i = 0; i < n + 1; i++) {
- for (int j = 0; j < n + 1 - i; j++) {
- if (x[j] > x[j + 1]) {
- int temp = x[j];
- x[j] = x[j + 1];
- x[j + 1] = temp;
- }
- }
- }
- return x;
- }
- int d(int* x, int n)
- {
- int dx = 0;
- for (int i = 0; i < n - 1; i++)
- {
- if (x[i + 1] - x[i] > dx)
- {
- dx = x[i + 1] - x[i];
- }
- }
- return dx;
- }
- void Task()
- {
- int w, h, n;
- cin >> w >> h >> n;
- int* x = new int[n + 2];
- int* y = new int[n + 2];
- for (int i = 0; i < n; i++) {
- cin >> x[i] >> y[i];
- }
- x[n] = 0;
- y[n] = 0;
- x[n + 1] = w;
- y[n + 1] = h;
- x = sort(x, n);
- y = sort(y, n);
- int dx = d(x, n);
- int dy = d(y, n);
- cout << endl << (dx - 1) * (dy - 1) << endl;
- }
- int main()
- {
- setlocale(0, "");
- Task();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement