 C++ Tutorials

# C++ Tutorials

Problem Name: Arrays-Max Value In Array
Problem Difficulty: None
Problem Constraints: N cannot be Negative. Range of Numbers can be between -1000000000 to 1000000000
Problem Description:
Take as input N, the size of array. Take N more inputs and store that in an array. Write a function which returns the maximum value in the array. Print the value returned.

2.Take Another N numbers as input and store them in an Array.

3.calculate the max value in the array and return that value.
Input Format: The first line contains integer n as the size of an array. Next n lines contains a single integer as an element of array.
Sample Input: 4
2
8
6
4
Output Format: Print the required output.
Sample Output: 8

=====Solution=====

``````#include <iostream>
#include <climits>
#include <algorithm>
using namespace std;

int main()
{
int n;
cin>>n;
int arr[n];
int max=0;

for(int i=0; i<n; i++){
cin>>arr[i];
}
max=arr;
for(int i=0; i<n; i++){
if(max<arr[i])
max=arr[i];
}

cout << "The max element is " << max << endl;

return 0;
}

``````

=====Solution=====

``````#include<iostream>
using namespace std;
int max (long long int arr[], long long int n)
{
long long int i, max = -1000000000;
for ( i = 0; i < n; i++)
{
if (arr[i] > max)
max = arr[i];
}
return max;
}
int main() {
long long int n;
cin >> n;
long long int i;
long long int arr[n];
for (i = 0; i < n; i++)
cin >> arr[i];

cout << max(arr, n);

return 0;
}``````