洛谷P1901 发射站
标签
- 单调栈
简明题意
- 无
思路
- 首先考虑暴力做法,能拿到60分,代码如下
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 1000000 + 10;
int n, h[maxn], w[maxn];
void solve()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d%d", &h[i], &w[i]);
int tower[maxn] = {
0 };
for (int i = 1; i <= n; i++)
{
for (int j = i +