zoukankan      html  css  js  c++  java
  • cf581B 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
    output
    2 3 4 0 

    对于每个a[i]询问要加上多少值才能大于a[i]右边的最大的一个

    这显然从后往前搜一遍完了

     1 #include<set>
     2 #include<map>
     3 #include<cmath>
     4 #include<ctime>
     5 #include<deque>
     6 #include<queue>
     7 #include<bitset>
     8 #include<cstdio>
     9 #include<cstdlib>
    10 #include<cstring>
    11 #include<iostream>
    12 #include<algorithm>
    13 #define LL long long
    14 #define inf 0x7fffffff
    15 #define pa pair<int,int>
    16 #define pi 3.1415926535897932384626433832795028841971
    17 using namespace std;
    18 inline LL read()
    19 {
    20     LL x=0,f=1;char ch=getchar();
    21     while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    22     while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    23     return x*f;
    24 }
    25 int n,a[100010],ans[100010];
    26 int main()
    27 {
    28     n=read();
    29     for(int i=1;i<=n;i++)a[i]=read();
    30     int mx=a[n]+1;
    31     for(int i=n-1;i>=1;i--)
    32     {
    33         ans[i]=max(0,mx-a[i]);
    34         mx=max(mx,a[i]+1);
    35     }
    36     for(int i=1;i<=n;i++)printf("%d ",ans[i]);
    37 }
    cf581B
    ——by zhber,转载请注明来源
  • 相关阅读:
    通过socket,实现简易版的通讯
    控制台报错[WDS] Disconnected!
    js里面可以提升性能的有哪些方法
    构造函数与普通函数的区别
    事件循环(event loop)
    二维数组的创建以及简单举例
    es5数组的api(了解)
    字符串的api (基础)
    git常用命令
    连接MongoDB失败,处理办法
  • 原文地址:https://www.cnblogs.com/zhber/p/4845143.html
Copyright © 2011-2022 走看看