codeforces 581B Luxurious Houses
2015-11-23 19:51
232 查看
B. Luxurious Houses
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
#include<cstdio> #include<algorithm> #include<cstring> using namespace std; int main() { int a[100005],b[100005]; int n; while(scanf("%d",&n)!=EOF) { int maxn=0; memset(b,0,sizeof(b)); for(int i=0;i<n;i++) scanf("%d",&a[i]); for(int i=n-1;i>=0;i--) { if(a[i]<=maxn) b[i]=maxn+1-a[i]; maxn=max(a[i],maxn); } for(int i=0;i<n-1;i++) printf("%d ",b[i]); printf("%d\n",b[n-1]); } return 0; }
Output
2 3 4 0
相关文章推荐
- 阿里巴巴集团去IOE运动的思考与总结
- 设计模式 - 创建型模式 - 工厂模式
- js将时间戳转换成日期格式
- 【C#】——文件夹中获取指定特点的文件名
- CentOS7 关闭防火墙
- URL的组成
- Android图片高斯模糊的一些方法
- 三种屏幕适配的方式
- 分页控件及其CSS样式
- ByteArrayInputStream 和 ByteArrayOutputStream
- 数据结构之链表_list
- Java JSON(org.json)
- 20本最好的免费的Python书籍
- OpenJudge_P8201 河中跳房子
- [c#][Windows 10 | Windows 10 mobile | Windows Phone] HttpClient 实现form-data POST上传请求
- 分治法求解集合的众数及其重数
- Java NIO系列教程(九) Java NIO与BIO
- Linux kernel多线程的几种实现
- xml的语法
- Java NIO系列教程(八) FileChannel