poj3250翻译+题解(单调栈)

最新推荐文章于 2022-02-18 16:41:27 发布

zyq_20030305

最新推荐文章于 2022-02-18 16:41:27 发布

阅读量315

点赞数 3

分类专栏： poj 算法单调栈数据结构文章标签： poj 算法单调栈数据结构

本文链接：https://blog.csdn.net/zyq_20030305/article/details/77150869

版权

算法同时被 3 个专栏收录

46 篇文章 0 订阅

订阅专栏

数据结构

12 篇文章 0 订阅

订阅专栏

poj

6 篇文章 0 订阅

订阅专栏

Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants to count the number of other cows that can see the top of other cows' heads.

Each cow i has a specified height h_i (1 ≤ h_i≤ 1,000,000,000) and is standing in a line of cows all facing east (to the right in our diagrams). Therefore, cow i can see the tops of the heads of cows in front of her (namely cows i+1, i+2, and so on), for as long as these cows are strictly shorter than cow i.

Consider this example:

        =
=       =
=   -   =         Cows facing right -->
=   =   =
= - = = =
= = = = = =
1 2 3 4 5 6

Cow#1 can see the hairstyle of cows #2, 3, 4
Cow#2 can see no cow's hairstyle
Cow#3 can see the hairstyle of cow #4
Cow#4 can see no cow's hairstyle
Cow#5 can see the hairstyle of cow 6
Cow#6 can see no cows at all!

Let c_i denote the number of cows whose hairstyle is visible from cow i; please compute the sum of c₁ through c_N.For this example, the desired is answer 3 + 0 + 1 + 0 + 1 + 0 = 5.

Input

Line 1: The number of cows, N.
Lines 2..N+1: Line i+1 contains a single integer that is the height of cow i.

Output

Line 1: A single integer that is the sum of c ₁ through c_N.

Sample Input

Sample Output

大概意思就是有n头牛,给了他们相应的高度,求可以被看到的牛有几头.

这道题我们不一定要求这头牛被几头牛看到,但是可以存当前点能看到几头牛标记一下,这是关键.

以下为代码:

#include<stdio.h>
int a[80005],f[80005];
int main()
{
	int n,i,j,top=1;
	long long ans=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		scanf("%d",&a[i]);
	f[1]=a[1];
	for(i=2;i<=n;i++)
	{
		if(f[top]>a[i])
			f[++top]=a[i],ans+=top-1;
		else
		{
			while(f[top]<=a[i]&&top>1&&f[top-1]<=a[i])
			{
				top--;
			}	
			f[top]=a[i];	
			ans+=top-1;	
		}			
	}
	printf("%lld",ans);
}