# Arrays Introduction C++

### Problem Statement :

```An array is a series of elements of the same type placed in contiguous memory locations that can be individually referenced by adding an index to a unique identifier.

For arrays of a known size, 10 in this case, use the following declaration:

int arr; //Declares an array named arr of size 10, i.e, you can
store 10 integers.

Note Unlike C, C++ allows dynamic allocation of arrays at runtime without special calls like malloc(). If
n = 10 , int arr[n] will create an array with space for 10 integers.

Accessing elements of an array:

Indexing in arrays starts from 0.So the first element is stored at
arr,the second element at arr and so on through arr.

You will be given an array of N integers and you have to print the integers in the reverse order.

Input Format

The first line of the input contains N , where N  is the number of integers.The next line contains N space-separated integers.

Constraints

1 <= N <= 1000
1 <= A[i] <=1000

Output Format

Print the N integers of the array in the reverse order, space-separated on a single line.```

### Solution :

```                            ```Solution in C :

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {

int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = n - 1; i >= 0; i--)
cout << arr[i] << ' ';
return 0;
}```
```

## Truck Tour

Suppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N-1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump. Initially, you have a tank of infinite capacity carrying no petr

## Queries with Fixed Length

Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon

## QHEAP1

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element