zoukankan      html  css  js  c++  java
  • CodeForces

    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.

    Examples

    Input

    5
    1 2 3 1 2
    

    Output

    3 2 0 2 0 

    Input

    4
    3 2 1 4
    

    Output

    2 3 4 0 

    思路:从后边扫,去看是否大于当前的最大值,然后就更新

    代码:

    #include<iostream>
    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    
    using namespace std;
    
    const int maxn=100005;
    
    int a[maxn],b[maxn];
    int main()
    {
        int n;
        cin>>n;
        for(int i=0;i<n;i++)
            cin>>a[i];
        int Max=0;
        for(int i=n-1;i>=0;i--)
        {
            if(a[i]>Max) b[i]=a[i];
            else if(a[i]==Max) b[i]=0;
            else
                b[i]=Max;
            Max=max(Max,a[i]);
        }
        for(int i=0;i<n-1;i++)
        {
            if(b[i]==a[i]) printf("0 ");
            else if(b[i]==0) printf("1 ");
            else
                printf("%d ",b[i]-a[i]+1);
        }
        printf("0
    ");
        return 0;
    }
  • 相关阅读:
    【蜕变之路】第20天 UUID和时间戳的生成 (2019年3月10日)
    3.EntityFramework的多种记录日志方式,记录错误并分析执行时间过长原因(系列4)
    reactnative资源
    代码
    模板匹配模型、原型模型和区别性特征模型各自如何解释汉字的知觉
    mysqldatadir 转移
    mysql主从设置windows
    心灵鸡汤
    测试的发现遗漏BUG的做法
    汉字模式匹配的过程
  • 原文地址:https://www.cnblogs.com/Staceyacm/p/10781865.html
Copyright © 2011-2022 走看看