Codeforces Round #322 (Div. 2)B. Luxurious Houses
2015-10-02 20:33
441 查看
B. Luxurious Houses
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
The capital of Berland has n multifloor buildings. The architect who built up the capital was very creative, so all the houses were
built in one row.
Let's enumerate all the houses from left to right, starting with one. A house is considered to be luxurious if the number of floors in it is strictly greater than in all the houses with larger
numbers. In other words, a house is luxurious if the number of floors in it is strictly greater than in all the houses, which are located to the right from it. In this task it is assumed that the heights of floors in the houses are the same.
The new architect is interested in n questions, i-th
of them is about the following: "how many floors should be added to the i-th house to make it luxurious?" (for all i from 1 to n,
inclusive). You need to help him cope with this task.
Note that all these questions are independent from each other — the answer to the question for house i does not affect other answers
(i.e., the floors to the houses are not actually added).
Input
The first line of the input contains a single number n (1 ≤ n ≤ 105)
— the number of houses in the capital of Berland.
The second line contains n space-separated positive integers hi (1 ≤ hi ≤ 109),
where hi equals
the number of floors in the i-th house.
Output
Print n integers a1, a2, ..., an,
where number ai is
the number of floors that need to be added to the house number i to make it luxurious. If the house is already luxurious and nothing
needs to be added to it, then ai should
be equal to zero.
All houses are numbered from left to right, starting from one.
Sample test(s)
input
output
input
output
题目简单就是题意看了半天,哎!!还是要好好学习英语。
要求加上x之后严格大于右边的数。
要注意的是严格大于右边的数。
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
The capital of Berland has n multifloor buildings. The architect who built up the capital was very creative, so all the houses were
built in one row.
Let's enumerate all the houses from left to right, starting with one. A house is considered to be luxurious if the number of floors in it is strictly greater than in all the houses with larger
numbers. In other words, a house is luxurious if the number of floors in it is strictly greater than in all the houses, which are located to the right from it. In this task it is assumed that the heights of floors in the houses are the same.
The new architect is interested in n questions, i-th
of them is about the following: "how many floors should be added to the i-th house to make it luxurious?" (for all i from 1 to n,
inclusive). You need to help him cope with this task.
Note that all these questions are independent from each other — the answer to the question for house i does not affect other answers
(i.e., the floors to the houses are not actually added).
Input
The first line of the input contains a single number n (1 ≤ n ≤ 105)
— the number of houses in the capital of Berland.
The second line contains n space-separated positive integers hi (1 ≤ hi ≤ 109),
where hi equals
the number of floors in the i-th house.
Output
Print n integers a1, a2, ..., an,
where number ai is
the number of floors that need to be added to the house number i to make it luxurious. If the house is already luxurious and nothing
needs to be added to it, then ai should
be equal to zero.
All houses are numbered from left to right, starting from one.
Sample test(s)
input
5 1 2 3 1 2
output
3 2 0 2 0
input
4 3 2 1 4
output
2 3 4 0
题目简单就是题意看了半天,哎!!还是要好好学习英语。
要求加上x之后严格大于右边的数。
要注意的是严格大于右边的数。
相关文章推荐
- 由脱库攻击谈口令字段的加密策略——密码泄露事件杂谈之一
- Mustache
- BBS数据库设计文档
- Java设计模式之命令模式
- sunstudio 12.3 on solaris 10
- iOS:UIView、UIControl、UIButton、UILabel简单的属性和方法常识
- 轮廓线DP POJ3254 && BZOJ 1087
- Repo安装遇到问题
- TTL值的含义以及与域名DNS TTL值的区别
- PHP、Mysql等网站建设交流看我另一个博客
- light oj 1029 - Civil and Evil Engineer (最大生成树+最小生成树)
- linux下的硬连接和符号链接(软连接)
- 安卓在xml文件(布局文件)中做一些细微改变却运行程序报错的原因
- 推断序列的端部的大小C规划
- 让HTML页面元素居中的各种实现方法
- 网络编程
- SLC教程
- unity3d 中 transform.position 与Rigidbody.position的同步问题
- hdu 5471(状压DP or 容斥)
- Java 常见异常及趣味解释