暴力TLE,求助
  • 板块P1105 平台
  • 楼主wu_si_qiao
  • 当前回复0
  • 已保存回复0
  • 发布时间2024/7/18 22:36
  • 上次更新2024/7/19 08:42:34
查看原帖
暴力TLE,求助
1042302
wu_si_qiao楼主2024/7/18 22:36
#include <bits/stdc++.h>
using namespace std;
int n, maxh, b;

struct pingtai {
	int h, l, r;
};

int main() {
	cin >> n;
	pingtai a[n + 2];

	for (int i = 1; i <= n; i++) {
		cin >> a[i].h >> a[i].l >> a[i].r;
	}

	for (int i = 1; i <= n; i++) {

		//l
		for (int j = 1; j <= n; j++) {
			if (a[i].l > a[j].l && a[i].h > a[j].h) {
				maxh = max(maxh, a[j].h);

			}
		}

		for (int k = 1; k <= n; i++) {
			if (a[k].h == maxh) {
				b = k;
				cout << k << " ";
			}
		}

		if (b == 0) {
			cout << 0 << " ";
		}

		//r
		for (int j = 1; j <= n; j++) {
			if (a[i].r < a[j].r && a[i].h > a[j].h) {
				maxh = max(maxh, a[j].h);

			}
		}

		for (int k = 1; k <= n; i++) {
			if (a[k].h == maxh) {
				b = k;
				cout << k << "\n";
			}
		}

		if (b == 0) {
			cout << 0 << "\n";
		}
	}

	return 0;
}
2024/7/18 22:36
加载中...