CodeForces 589B Layer Cake

我是很蠢的写法，就是暴力枚举，枚举每个宽，然后对于每个宽，枚举长，然后记录最大值就行，n^2logn的复杂度，竟然300+ms就跑完了，不可思议

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <string>
using namespace std;
#define ll long long
#define maxn 4005
struct Node
{
	int a, b;//a<b
};
Node cake[maxn];
//Node cake1[maxn], cake2[maxn];
int N;
int mina[maxn], minb[maxn];
bool cmp1(Node& x, Node& y)//按小边排序
{
	return (x.a < y.a) || (x.a == y.a&&x.b < y.b);
}
bool cmp2(Node& x, Node& y)//按大边排序
{
	return (x.b < y.b) || (x.b == y.b&&x.a < y.a);
}
int main()
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	scanf("%d", &N);
	int ta, tb;
	for (int i = 0; i < N; ++i)
	{
		scanf("%d%d", &ta, &tb);
		if (ta < tb)
		{
			cake[i].a = ta;
			cake[i].b = tb;
		}
		else
		{
			cake[i].a = tb;
			cake[i].b = ta;
		}
	}
	ll volume = 0, tmp = 0;
	int ra = 0, rb = 0;
	ll cnt;
	sort(cake, cake + N, cmp1);//先按小边排序
	/*for (int i = 0; i < N; ++i)
		printf("%d %d\n", cake[i].a, cake[i].b);*/
	for (int i = N - 1; i >= 0; --i)//枚举小边
	{
		if (i == 0 || cake[i].a != cake[i - 1].a)
		{
			//printf("i %d\n", i);
			ta = cake[i].a;
			sort(cake + i, cake + N, cmp2);
			cnt = 0;
			for (int j = N - 1; j >= i; --j)
			{
				if (cake[j].a >= ta)
					++cnt;
				//printf("a %d ta %d\n", cake[i].a, ta);
				//printf("j %d cnt %I64d\n", j, cnt);
				if (j == i || cake[j].b != cake[j - 1].b)
				{
					tmp = cnt*ta*cake[j].b;
					if (tmp > volume)
					{
						volume = tmp;
						ra = ta;
						rb = cake[j].b;
					}
				}
			}
		}
	}
	printf("%I64d\n%d %d\n", volume, rb, ra);
	//system("pause");
	//while (1);
	return 0;
}