Added Greedy Problem MaximumIncreasingSubarray

Author: shobhitbehl

Greedy/MaximumIncreasingSubarray/MaximumIncreasingSubarray.cpp

@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+
+typedef long long int lli;
+
+using namespace std;
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+    cout.precision(50);
+    lli n;
+    cin >> n;
+    lli a[n];
+    for(int i = 0; i<n; i++)
+    {
+        cin >> a[i];
+    }
+    lli ans = 1;
+    lli out = 1;
+    for(int i = 1; i<n; i++)
+    {
+        if(a[i] > a[i-1])
+        {
+            ans++;
+        }
+        else
+        {
+            ans = 1;
+        }
+        out = max(out,ans);
+    }
+    cout << out << endl;
+}

Greedy/MaximumIncreasingSubarray/ProblemStatement.md

@@ -0,0 +1,5 @@
+### Maximum Increasing Subarray
+
+You are given array consisting of *n* integers. Your task is to find the maximum length of an increasing subarray of the given array.
+
+A subarray is the sequence of consecutive elements of the array. Subarray is called increasing if each element of this subarray strictly greater than previous.

Search/BinarySearch/tags.TPQofa

@@ -0,0 +1,4 @@
+myarray	bsearch.cpp	/^std::vector<int> myarray;$/;"	v
+binary_search	bsearch.cpp	/^bool binary_search(int number)$/;"	f
+is_digits	bsearch.cpp	/^bool is_digits(const std::string &str)$/;"	f
+main	bsearch.cpp	/^int main(int argc, char const *argv[])$/;"	f