snipt

Ctrl+h for KB shortcuts

C++

SUB ARRAY

#include<bits/stdc++.h>
using namespace std;

// https://www.geeksforgeeks.org/longest-sub-array-with-maximum-average-value/
int maxavgsubarray(int a[],int n){
    int mx = INT_MIN;
    for(int i = 0;i < n;i++){
        if(a[i] > mx){
            mx = a[i];
        }
    }
    int i = 0;
    int ans = 1;
    int fin_ans = 1;
    while(i < n-1){
      while(i < n && a[i]  == mx && a[i+1] == a[i]){
          ans++;
          i++;
      }
      i++;
      fin_ans = max(fin_ans,ans);
      ans = 1;
    }
    return fin_ans;
}
int main(){
    int n;
    cin >> n;
    int a[n];
    for(int i = 0;i < n;i++){cin >> a[i];}
    cout << maxavgsubarray(a,n);
    return 0;
}
https://snippets.siftie.com/embed/0a4fa87294cba073559f5780efe856e5/
/raw/0a4fa87294cba073559f5780efe856e5/
0a4fa87294cba073559f5780efe856e5
cpp
C++
34
2019-04-20T16:57:23
True
False
False
Feb 19, 2019 at 10:53 AM
/api/public/snipt/148266/
sub-array
<table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><a href="#L-1"> 1</a> <a href="#L-2"> 2</a> <a href="#L-3"> 3</a> <a href="#L-4"> 4</a> <a href="#L-5"> 5</a> <a href="#L-6"> 6</a> <a href="#L-7"> 7</a> <a href="#L-8"> 8</a> <a href="#L-9"> 9</a> <a href="#L-10">10</a> <a href="#L-11">11</a> <a href="#L-12">12</a> <a href="#L-13">13</a> <a href="#L-14">14</a> <a href="#L-15">15</a> <a href="#L-16">16</a> <a href="#L-17">17</a> <a href="#L-18">18</a> <a href="#L-19">19</a> <a href="#L-20">20</a> <a href="#L-21">21</a> <a href="#L-22">22</a> <a href="#L-23">23</a> <a href="#L-24">24</a> <a href="#L-25">25</a> <a href="#L-26">26</a> <a href="#L-27">27</a> <a href="#L-28">28</a> <a href="#L-29">29</a> <a href="#L-30">30</a> <a href="#L-31">31</a> <a href="#L-32">32</a> <a href="#L-33">33</a></pre></div></td><td class="code"><div class="highlight"><pre><span></span><span id="L-1"><a name="L-1"></a><span class="cp">#include</span><span class="cpf">&lt;bits/stdc++.h&gt;</span><span class="cp"></span> </span><span id="L-2"><a name="L-2"></a><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span> </span><span id="L-3"><a name="L-3"></a> </span><span id="L-4"><a name="L-4"></a><span class="c1">// https://www.geeksforgeeks.org/longest-sub-array-with-maximum-average-value/</span> </span><span id="L-5"><a name="L-5"></a><span class="kt">int</span> <span class="nf">maxavgsubarray</span><span class="p">(</span><span class="kt">int</span> <span class="n">a</span><span class="p">[],</span><span class="kt">int</span> <span class="n">n</span><span class="p">){</span> </span><span id="L-6"><a name="L-6"></a> <span class="kt">int</span> <span class="n">mx</span> <span class="o">=</span> <span class="n">INT_MIN</span><span class="p">;</span> </span><span id="L-7"><a name="L-7"></a> <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span><span class="n">i</span> <span class="o">&lt;</span> <span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">){</span> </span><span id="L-8"><a name="L-8"></a> <span class="k">if</span><span class="p">(</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">&gt;</span> <span class="n">mx</span><span class="p">){</span> </span><span id="L-9"><a name="L-9"></a> <span class="n">mx</span> <span class="o">=</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">];</span> </span><span id="L-10"><a name="L-10"></a> <span class="p">}</span> </span><span id="L-11"><a name="L-11"></a> <span class="p">}</span> </span><span id="L-12"><a name="L-12"></a> <span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-13"><a name="L-13"></a> <span class="kt">int</span> <span class="n">ans</span> <span class="o">=</span> <span class="mi">1</span><span class="p">;</span> </span><span id="L-14"><a name="L-14"></a> <span class="kt">int</span> <span class="n">fin_ans</span> <span class="o">=</span> <span class="mi">1</span><span class="p">;</span> </span><span id="L-15"><a name="L-15"></a> <span class="k">while</span><span class="p">(</span><span class="n">i</span> <span class="o">&lt;</span> <span class="n">n</span><span class="o">-</span><span class="mi">1</span><span class="p">){</span> </span><span id="L-16"><a name="L-16"></a> <span class="k">while</span><span class="p">(</span><span class="n">i</span> <span class="o">&lt;</span> <span class="n">n</span> <span class="o">&amp;&amp;</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">==</span> <span class="n">mx</span> <span class="o">&amp;&amp;</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="o">+</span><span class="mi">1</span><span class="p">]</span> <span class="o">==</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]){</span> </span><span id="L-17"><a name="L-17"></a> <span class="n">ans</span><span class="o">++</span><span class="p">;</span> </span><span id="L-18"><a name="L-18"></a> <span class="n">i</span><span class="o">++</span><span class="p">;</span> </span><span id="L-19"><a name="L-19"></a> <span class="p">}</span> </span><span id="L-20"><a name="L-20"></a> <span class="n">i</span><span class="o">++</span><span class="p">;</span> </span><span id="L-21"><a name="L-21"></a> <span class="n">fin_ans</span> <span class="o">=</span> <span class="n">max</span><span class="p">(</span><span class="n">fin_ans</span><span class="p">,</span><span class="n">ans</span><span class="p">);</span> </span><span id="L-22"><a name="L-22"></a> <span class="n">ans</span> <span class="o">=</span> <span class="mi">1</span><span class="p">;</span> </span><span id="L-23"><a name="L-23"></a> <span class="p">}</span> </span><span id="L-24"><a name="L-24"></a> <span class="k">return</span> <span class="n">fin_ans</span><span class="p">;</span> </span><span id="L-25"><a name="L-25"></a><span class="p">}</span> </span><span id="L-26"><a name="L-26"></a><span class="kt">int</span> <span class="nf">main</span><span class="p">(){</span> </span><span id="L-27"><a name="L-27"></a> <span class="kt">int</span> <span class="n">n</span><span class="p">;</span> </span><span id="L-28"><a name="L-28"></a> <span class="n">cin</span> <span class="o">&gt;&gt;</span> <span class="n">n</span><span class="p">;</span> </span><span id="L-29"><a name="L-29"></a> <span class="kt">int</span> <span class="n">a</span><span class="p">[</span><span class="n">n</span><span class="p">];</span> </span><span id="L-30"><a name="L-30"></a> <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span><span class="n">i</span> <span class="o">&lt;</span> <span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">){</span><span class="n">cin</span> <span class="o">&gt;&gt;</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">];}</span> </span><span id="L-31"><a name="L-31"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="n">maxavgsubarray</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="n">n</span><span class="p">);</span> </span><span id="L-32"><a name="L-32"></a> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-33"><a name="L-33"></a><span class="p">}</span> </span></pre></div> </td></tr></table>
--- 
+++ 
@@ -0,0 +1,33 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+// https://www.geeksforgeeks.org/longest-sub-array-with-maximum-average-value/
+int maxavgsubarray(int a[],int n){
+    int mx = INT_MIN;
+    for(int i = 0;i < n;i++){
+        if(a[i] > mx){
+            mx = a[i];
+        }
+    }
+    int i = 0;
+    int ans = 1;
+    int fin_ans = 1;
+    while(i < n-1){
+      while(i < n && a[i]  == mx && a[i+1] == a[i]){
+          ans++;
+          i++;
+      }
+      i++;
+      fin_ans = max(fin_ans,ans);
+      ans = 1;
+    }
+    return fin_ans;
+}
+int main(){
+    int n;
+    cin >> n;
+    int a[n];
+    for(int i = 0;i < n;i++){cin >> a[i];}
+    cout << maxavgsubarray(a,n);
+    return 0;
+}