zoukankan      html  css  js  c++  java
  • 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 ifrom 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.

    Example

    Input
    5
    1 2 3 1 2
    Output
    3 2 0 2 0 
    Input
    4
    3 2 1 4
    Output
    2 3 4 0 
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int n;
     4 long long int num[100005],maxn;
     5 int main()
     6 {
     7     while(~scanf("%d",&n))
     8     {
     9         for(int i = 0; i < n; i++)
    10             scanf("%lld",&num[i]); 
    11         
    12         maxn = num[n-1];
    13         num[n-1] = 0;
    14         for(int i = n-2; i >= 0; i--)
    15         {
    16             if(num[i] <= maxn)
    17             {
    18                 num[i] = maxn - num[i] + 1; 
    19             }
    20             else
    21             {
    22                 maxn = num[i];
    23                 num[i] = 0;
    24             }
    25         }
    26         for(int i = 0; i < n; i++)
    27         {        
    28             printf("%lld",num[i]);
    29             if(i!=n-1) printf(" ");        
    30         }
    31         printf("
    ");
    32     }
    33     return 0;
    34 }
  • 相关阅读:
    渗透测试靶场
    Ubuntu kylin优麒麟下配置Hadoop环境
    虚拟机win+IIs+asp+access搭建网站过程
    百度增强搜索
    渗透入门——术语概述
    api如何获取cookie
    还在纠结接口文档的事儿呢?
    为什么需要API管理平台
    自动生成接口文档的三种方式
    轻量化API测试工具整理
  • 原文地址:https://www.cnblogs.com/jj81/p/7582424.html
Copyright © 2011-2022 走看看