SCU-2511: Moooo【单调栈】_farmer john's n (1 <= n <= 50,000) cows are standi-CSDN博客

本文链接：https://blog.csdn.net/qq_29600137/article/details/50662611

2511: Moooo

Submit your solution Discuss this problem Best solutions

Description

Farmer John's N (1 <= N <= 50,000) cows are standing in a very straight row and mooing. Each cow has a unique height h in the range 1..2,000,000,000 nanometers (FJ really is a stickler for precision). Each cow moos at some volume v in the range 1..10,000. This "moo" travels across the row of cows in both directions (except for the end cows, obviously). Curiously, it is heard only by the closest cow in each direction whose height is strictly larger than that of the mooing cow (so each moo will be heard by 0, 1 or 2 other cows, depending on not whether or taller cows exist to the mooing cow's right or left).

The total moo volume heard by given cow is the sum of all the moo volumes v for all cows whose mooing reaches the cow. Since some (presumably taller) cows might be subjected to a very large moo volume, FJ wants to buy earmuffs for the cow whose hearing is most threatened. Please compute the loudest moo volume heard by any cow.

Input

The input file contains multiple test cases, for each test case:

* Line 1: A single integer, N.

* Lines 2..N+1: Line i+1 contains two space-separated integers, h and v, for the cow standing at location i.

Process till EOF.

Output

For each test case, output:
* Line 1: The loudest moo volume heard by any single cow.

Sample Input

Sample Output

Source

USACO 2006 March

解题思路：

有一排牛，我们输入牛的身高和叫声，要求是牛的叫声是会被左右两边比他身高高的第一头牛听到，问那一头牛听到的叫声最大，所以我们从左右两边各进行一次，利用栈将比当前这头牛低的全部出栈，找到比他高的带当前位置累加起来。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<stack>
#define LL long long 
#define M 100009
using namespace std;
int h[M],v[M],n,ans[M];
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		 memset(ans,0,sizeof(ans));
		 int i,j;
		 stack<int> s;
		 for(i=0;i<n;i++)
		 {
		 	scanf("%d%d",&h[i],&v[i]);
		 }
		 int you=0;
		 for(i=0;i<n;i++)
		 {
		 	while(!s.empty()&&h[s.top()]<h[i]) s.pop();
		 	if(!s.empty())
		 	{
		 		ans[s.top()]+=v[i];
		 		you=max(you,ans[s.top()]);
		 	}
		 	s.push(i);
		 }
		 while(!s.empty())
		 s.pop();
		 for(i=n-1;i>=0;i--)
		{
			while(!s.empty()&&h[s.top()]<h[i]) s.pop();
			if(!s.empty())
			{
				ans[s.top()]+=v[i];
				you=max(you,ans[s.top()]);
			}
			s.push(i);
		}
		printf("%d\n",you);
	}
	return 0;
}