Walls Reconstruction - Strictly Increasing Order

Walls Reconstruction - Strictly Increasing Order --TCS NQT 

Problem:

There are N walls constructed in increasing order of height. A mason wants to reconstruct the walls with minimal changes in height so that the height of the N walls are in strictly increasing order. The program must accept N integers representing the height of the N walls as the input. The program must print the total height of the N walls after the reconstruction as the output. 

Boundary Condition(s): 

2 <= N <= 100 

1 <= Each integer value <= 1000 

Input Format: 

The first line contains N. The second line contains N integers separated by a space. 

Output Format:

The first line contains the total height of the N walls after the reconstruction.

Example Input/Output 1: 

Input: 

5 

2 2 2 5 8 

Output: 

22 

Explanation: 

Here N = 5, the heights of the 5 walls are 2, 2, 2, 5 and 8. After reconstruction of the 2nd wall and 3rd wall (with minimal changes in height), the heights of the 5 walls become 2, 3, 4, 5 and 8. Now the heights of the 5 walls are in strictly increasing order. The total height of the 5 walls after the reconstruction is 22 (2+3+4+5+8). So 22 is printed as the output. 

Example Input/Output 2: 

Input: 

6 

1 3 3 3 3 4 

Output: 

26

Program:

n = int(input())

l = list(map(int,input().split()))

ans = [l[0]] 

for i in range(1,n): 

    if ans[-1] < l[i]:

        ans.append(l[i])

    else:

        ans.append(max(ans[-1],l[i])+1)

print(sum(ans))           

Comments

Post a Comment

Popular posts from this blog

Pronic Integers in N - InfyTQ question

Pronic Integers in N - InfyTQ question Problem:  The program must accept an integer N as the input. The program must print all the pronic integers formed by a series of continuously occurring digits (in the same order) in N as the output. The pronic integers can be represented as n*(n+1). Input:  93042861 Output: 930 30 0 42 2 6 Program: import math  s = input().strip() def check_pronic(num):      sq = math.floor(math.sqrt(num))      return (sq*(sq+1)) == num  l = []   for i in range(len(s)):      for j in range(i,len(s)):          substr = int(s[i:j+1])          if s[i:j+1] == "0":             l.append(substr)         elif s[i:j+1][0]!='0' and check_pronic(substr):             l.append(substr)  print(*l)             Expl...
Read more

Count Strong Points - Accenture

 Count Strong Points - Accenture Problem: The program must accept an integer matrix of size RxC as the input. The program must print the number of strong points in the given matrix as the output. The strong points are located at the element(s) whose all the surrounding elements are smaller than the given element. Input:  3 3  56 92 45  19 41 51  55 31 80 Output: 3  Program: n,m = map(int,input().split()) l = []  for i in range(n):      l.append(list(map(int,input().split()))) count = 0      for i in range(n):      for j in range(m):         c = 0         if i-1 >= 0 and l[i-1][j] >= l[i][j]:             c = 1          if i+1 < n and l[i+1][j] >= l[i][j]:              c = 1          if j-1 >= 0 and l[i][j-1] >= l[i][j]:     ...
Read more

Letters at position of multiples of a number

Letters at position of multiples of a number   Problem: A string of length L consists of characters is passed as input to the program. A given number N is also passed as the input to the program. The program must print the characters at the positions which are multiples of the given number.  Input Format:  The first line will contain the string of length L.  The second line will contain the number N.  Boundary Conditions:  3 <= L <= 50  1 <= N <= 30  Output Format:  The characters at the positions which are multiples of the given number.  Example Input/Output 1:  Input:  abcdef  3  Output:  cf  Explanation:  Multiples of 3 are like 3,6,9,... So the characters at positions 3,6 namely c and f are printed as output.  Example Input/Output 2:  Input:  environment  2  Output:  niomn  Explanation:  As it must be multiples of 2, the characters at even pos...
Read more