单调栈问题系列
来源:互联网 发布:jquery查找子元素数组 编辑:程序博客网 时间:2024/05/11 09:01
Description
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 hi (1 ≤ hi ≤ 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 ci denote the number of cows whose hairstyle is visible from cow i; please compute the sum of c1 through cN.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 c1 through cN.
Sample Input
6
10
3
7
4
12
2
Sample Output
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 hi (1 ≤ hi ≤ 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 ci denote the number of cows whose hairstyle is visible from cow i; please compute the sum of c1 through cN.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 c1 through cN.
Sample Input
6
10
3
7
4
12
2
Sample Output
5
import java.util.Arrays;import java.util.Stack;public class Cow {//每头牛向右看,只能看到比它矮的(相等的看不到),问你所有牛能看到的牛总数;//6 10 3 7 4 12 2public static void main(String[] args) {int[] A={6, 10, 3, 7, 4, 12, 2};int[] right=new int[A.length];Stack<Integer> stack=new Stack<Integer>();for(int i=A.length-1;i>=0;i--){if(stack.isEmpty()){stack.push(i);}else{while(!stack.isEmpty()){if(A[stack.peek()]<A[i]){right[i]++;int temp=stack.pop();right[i]+=right[temp];}else{break;}}stack.push(i);}}int count=0;for(int i=0;i<right.length;i++){count+=right[i];}System.out.println(count);System.out.println(Arrays.toString(right));}}
阅读全文
0 0
- 单调栈问题系列
- 单调栈问题系列
- 单调栈 单调队列
- BITOJ 木板墙问题(单调栈)
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- - Buy Tickets POJ
- Android系统UI显示图层控制方法
- linux设置默认启动到字符界面
- MUI开发注意事项 Uncaught ReferenceError: plus is not defined
- 计算公式封装
- 单调栈问题系列
- 2.ARM中的异常中断基本概念
- JNI实现源码分析【四 函数调用】
- 正确的 Composer 扩展包安装方法
- 请求第三方接口返回json格式数据的解析
- ViewHolder为什么要被声明成静态内部类
- Oracle PGA详解
- viewpager实现图片放大缩小
- flask 学习