mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 04:18:34 +08:00
361 lines
26 KiB
HTML
361 lines
26 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
|
<meta name="generator" content="Doxygen 1.9.6"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Algorithms_in_C++: dynamic_programming Namespace Reference</title>
|
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../jquery.js"></script>
|
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../resize.js"></script>
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
|
<script type="text/javascript" src="../../search/search.js"></script>
|
|
<script type="text/x-mathjax-config">
|
|
MathJax.Hub.Config({
|
|
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
|
jax: ["input/TeX","output/HTML-CSS"],
|
|
});
|
|
</script>
|
|
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr id="projectrow">
|
|
<td id="projectalign">
|
|
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.6 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('dd/d24/namespacedynamic__programming.html','../../'); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="summary">
|
|
<a href="#func-members">Functions</a> </div>
|
|
<div class="headertitle"><div class="title">dynamic_programming Namespace Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p>Dynamic Programming algorithms.
|
|
<a href="../../dd/d24/namespacedynamic__programming.html#details">More...</a></p>
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:a0a2215194e58786c34db1ccaf8031079"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">LIS</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< uint64_t > &a, const uint32_t &n)</td></tr>
|
|
<tr class="memdesc:a0a2215194e58786c34db1ccaf8031079"><td class="mdescLeft"> </td><td class="mdescRight">Calculate the longest increasing subsequence for the specified numbers. <br /></td></tr>
|
|
<tr class="separator:a0a2215194e58786c34db1ccaf8031079"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:afe9f45b6e30ee187509da2d1d0093412"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">lps</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &a)</td></tr>
|
|
<tr class="memdesc:afe9f45b6e30ee187509da2d1d0093412"><td class="mdescLeft"> </td><td class="mdescRight">Function that returns the longest palindromic subsequence of a string. <br /></td></tr>
|
|
<tr class="separator:afe9f45b6e30ee187509da2d1d0093412"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a5239174fa0d987f2c67edc1f2af82beb"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">maxCircularSum</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > &arr)</td></tr>
|
|
<tr class="memdesc:a5239174fa0d987f2c67edc1f2af82beb"><td class="mdescLeft"> </td><td class="mdescRight">returns the maximum contiguous circular sum of an array <br /></td></tr>
|
|
<tr class="separator:a5239174fa0d987f2c67edc1f2af82beb"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p>Dynamic Programming algorithms. </p>
|
|
<p>Dynamic programming algorithms.</p>
|
|
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
|
|
<p>Dynamic Programming algorithm.</p>
|
|
<p>Dynamic Programming Algorithms.</p>
|
|
<p>for <code>assert</code> for IO operations for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></code> library for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></code> STL library</p>
|
|
<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a> for io operations</p>
|
|
<p>Dynamic Programming algorithms</p>
|
|
<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a> for IO operations</p>
|
|
<p>Dynamic Programming algorithms</p>
|
|
<p>for assert for IO operations</p>
|
|
<p>Dynamic Programming algorithms</p>
|
|
<p>for std::assert for IO operations for unordered map</p>
|
|
<p>Dynamic Programming algorithms </p>
|
|
</div><h2 class="groupheader">Function Documentation</h2>
|
|
<a id="a0a2215194e58786c34db1ccaf8031079" name="a0a2215194e58786c34db1ccaf8031079"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a0a2215194e58786c34db1ccaf8031079">◆ </a></span>LIS()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">uint64_t dynamic_programming::LIS </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< uint64_t > & </td>
|
|
<td class="paramname"><em>a</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const uint32_t & </td>
|
|
<td class="paramname"><em>n</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Calculate the longest increasing subsequence for the specified numbers. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">a</td><td>the array used to calculate the longest increasing subsequence </td></tr>
|
|
<tr><td class="paramname">n</td><td>the size used for the arrays </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>the length of the longest increasing subsequence in the <code>a</code> array of size <code>n</code> </dd></dl>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 39</span> {</div>
|
|
<div class="line"><span class="lineno"> 40</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> lis(n);</div>
|
|
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; ++i) {</div>
|
|
<div class="line"><span class="lineno"> 42</span> lis[i] = 1;</div>
|
|
<div class="line"><span class="lineno"> 43</span> }</div>
|
|
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; ++i) {</div>
|
|
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < i; ++j) {</div>
|
|
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span> (a[i] > a[j] && lis[i] < lis[j] + 1) {</div>
|
|
<div class="line"><span class="lineno"> 47</span> lis[i] = lis[j] + 1;</div>
|
|
<div class="line"><span class="lineno"> 48</span> }</div>
|
|
<div class="line"><span class="lineno"> 49</span> }</div>
|
|
<div class="line"><span class="lineno"> 50</span> }</div>
|
|
<div class="line"><span class="lineno"> 51</span> <span class="keywordtype">int</span> res = 0;</div>
|
|
<div class="line"><span class="lineno"> 52</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; ++i) {</div>
|
|
<div class="line"><span class="lineno"> 53</span> res = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(res, lis[i]);</div>
|
|
<div class="line"><span class="lineno"> 54</span> }</div>
|
|
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">return</span> res;</div>
|
|
<div class="line"><span class="lineno"> 56</span>}</div>
|
|
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
|
|
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
|
</div><!-- fragment --><div class="dynheader">
|
|
Here is the call graph for this function:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.svg" width="312" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="afe9f45b6e30ee187509da2d1d0093412" name="afe9f45b6e30ee187509da2d1d0093412"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#afe9f45b6e30ee187509da2d1d0093412">◆ </a></span>lps()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> dynamic_programming::lps </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> & </td>
|
|
<td class="paramname"><em>a</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Function that returns the longest palindromic subsequence of a string. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">a</td><td>string whose longest palindromic subsequence is to be found </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>longest palindromic subsequence of the string </dd></dl>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 31</span> {</div>
|
|
<div class="line"><span class="lineno"> 32</span> <span class="keyword">const</span> <span class="keyword">auto</span> b = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(a.rbegin(), a.rend());</div>
|
|
<div class="line"><span class="lineno"> 33</span> <span class="keyword">const</span> <span class="keyword">auto</span> m = a.length();</div>
|
|
<div class="line"><span class="lineno"> 34</span> <span class="keyword">using </span>ind_type = std::string::size_type;</div>
|
|
<div class="line"><span class="lineno"> 35</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<ind_type></a> > res(m + 1,</div>
|
|
<div class="line"><span class="lineno"> 36</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<ind_type></a>(m + 1));</div>
|
|
<div class="line"><span class="lineno"> 37</span> </div>
|
|
<div class="line"><span class="lineno"> 38</span> <span class="comment">// Finding the length of the longest</span></div>
|
|
<div class="line"><span class="lineno"> 39</span> <span class="comment">// palindromic subsequence and storing</span></div>
|
|
<div class="line"><span class="lineno"> 40</span> <span class="comment">// in a 2D array in bottoms-up manner</span></div>
|
|
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">for</span> (ind_type i = 0; i <= m; i++) {</div>
|
|
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">for</span> (ind_type j = 0; j <= m; j++) {</div>
|
|
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">if</span> (i == 0 || j == 0) {</div>
|
|
<div class="line"><span class="lineno"> 44</span> res[i][j] = 0;</div>
|
|
<div class="line"><span class="lineno"> 45</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (a[i - 1] == b[j - 1]) {</div>
|
|
<div class="line"><span class="lineno"> 46</span> res[i][j] = res[i - 1][j - 1] + 1;</div>
|
|
<div class="line"><span class="lineno"> 47</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><span class="lineno"> 48</span> res[i][j] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(res[i - 1][j], res[i][j - 1]);</div>
|
|
<div class="line"><span class="lineno"> 49</span> }</div>
|
|
<div class="line"><span class="lineno"> 50</span> }</div>
|
|
<div class="line"><span class="lineno"> 51</span> }</div>
|
|
<div class="line"><span class="lineno"> 52</span> <span class="comment">// Length of longest palindromic subsequence</span></div>
|
|
<div class="line"><span class="lineno"> 53</span> <span class="keyword">auto</span> idx = res[m][m];</div>
|
|
<div class="line"><span class="lineno"> 54</span> <span class="comment">// Creating string of index+1 length</span></div>
|
|
<div class="line"><span class="lineno"> 55</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ans(idx, <span class="charliteral">'\0'</span>);</div>
|
|
<div class="line"><span class="lineno"> 56</span> ind_type i = m, j = m;</div>
|
|
<div class="line"><span class="lineno"> 57</span> </div>
|
|
<div class="line"><span class="lineno"> 58</span> <span class="comment">// starting from right-most bottom-most corner</span></div>
|
|
<div class="line"><span class="lineno"> 59</span> <span class="comment">// and storing them one by one in ans</span></div>
|
|
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">while</span> (i > 0 && j > 0) {</div>
|
|
<div class="line"><span class="lineno"> 61</span> <span class="comment">// if current characters in a and b are same</span></div>
|
|
<div class="line"><span class="lineno"> 62</span> <span class="comment">// then it is a part of the ans</span></div>
|
|
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">if</span> (a[i - 1] == b[j - 1]) {</div>
|
|
<div class="line"><span class="lineno"> 64</span> ans[idx - 1] = a[i - 1];</div>
|
|
<div class="line"><span class="lineno"> 65</span> i--;</div>
|
|
<div class="line"><span class="lineno"> 66</span> j--;</div>
|
|
<div class="line"><span class="lineno"> 67</span> idx--;</div>
|
|
<div class="line"><span class="lineno"> 68</span> }</div>
|
|
<div class="line"><span class="lineno"> 69</span> <span class="comment">// If they are not same, find the larger of the</span></div>
|
|
<div class="line"><span class="lineno"> 70</span> <span class="comment">// two and move in that direction</span></div>
|
|
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (res[i - 1][j] > res[i][j - 1]) {</div>
|
|
<div class="line"><span class="lineno"> 72</span> i--;</div>
|
|
<div class="line"><span class="lineno"> 73</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><span class="lineno"> 74</span> j--;</div>
|
|
<div class="line"><span class="lineno"> 75</span> }</div>
|
|
<div class="line"><span class="lineno"> 76</span> }</div>
|
|
<div class="line"><span class="lineno"> 77</span> </div>
|
|
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">return</span> ans;</div>
|
|
<div class="line"><span class="lineno"> 79</span>}</div>
|
|
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
|
|
</div><!-- fragment --><div class="dynheader">
|
|
Here is the call graph for this function:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.svg" width="308" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a5239174fa0d987f2c67edc1f2af82beb" name="a5239174fa0d987f2c67edc1f2af82beb"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a5239174fa0d987f2c67edc1f2af82beb">◆ </a></span>maxCircularSum()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int dynamic_programming::maxCircularSum </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > & </td>
|
|
<td class="paramname"><em>arr</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>returns the maximum contiguous circular sum of an array </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">arr</td><td>is the array/vector </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>int which is the maximum sum </dd></dl>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 27</span>{</div>
|
|
<div class="line"><span class="lineno"> 28</span> <span class="comment">// Edge Case</span></div>
|
|
<div class="line"><span class="lineno"> 29</span> <span class="keywordflow">if</span> (arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == 1)</div>
|
|
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">return</span> arr[0];</div>
|
|
<div class="line"><span class="lineno"> 31</span> </div>
|
|
<div class="line"><span class="lineno"> 32</span> <span class="comment">// Sum variable which stores total sum of the array.</span></div>
|
|
<div class="line"><span class="lineno"> 33</span> <span class="keywordtype">int</span> sum = 0;</div>
|
|
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
|
|
<div class="line"><span class="lineno"> 35</span> sum += arr[i];</div>
|
|
<div class="line"><span class="lineno"> 36</span> }</div>
|
|
<div class="line"><span class="lineno"> 37</span> </div>
|
|
<div class="line"><span class="lineno"> 38</span> <span class="comment">// Every variable stores first value of the array.</span></div>
|
|
<div class="line"><span class="lineno"> 39</span> <span class="keywordtype">int</span> current_max = arr[0], max_so_far = arr[0], current_min = arr[0], min_so_far = arr[0];</div>
|
|
<div class="line"><span class="lineno"> 40</span> </div>
|
|
<div class="line"><span class="lineno"> 41</span> <span class="comment">// Concept of Kadane's Algorithm</span></div>
|
|
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
|
|
<div class="line"><span class="lineno"> 43</span> <span class="comment">// Kadane's Algorithm to find Maximum subarray sum.</span></div>
|
|
<div class="line"><span class="lineno"> 44</span> current_max = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(current_max + arr[i], arr[i]);</div>
|
|
<div class="line"><span class="lineno"> 45</span> max_so_far = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(max_so_far, current_max);</div>
|
|
<div class="line"><span class="lineno"> 46</span> </div>
|
|
<div class="line"><span class="lineno"> 47</span> <span class="comment">// Kadane's Algorithm to find Minimum subarray sum.</span></div>
|
|
<div class="line"><span class="lineno"> 48</span> current_min = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(current_min + arr[i], arr[i]);</div>
|
|
<div class="line"><span class="lineno"> 49</span> min_so_far = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(min_so_far, current_min);</div>
|
|
<div class="line"><span class="lineno"> 50</span> }</div>
|
|
<div class="line"><span class="lineno"> 51</span> </div>
|
|
<div class="line"><span class="lineno"> 52</span> <span class="keywordflow">if</span> (min_so_far == sum)</div>
|
|
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">return</span> max_so_far;</div>
|
|
<div class="line"><span class="lineno"> 54</span> </div>
|
|
<div class="line"><span class="lineno"> 55</span> <span class="comment">// Return the maximum value</span></div>
|
|
<div class="line"><span class="lineno"> 56</span> <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(max_so_far, sum - min_so_far);</div>
|
|
<div class="line"><span class="lineno"> 57</span>}</div>
|
|
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
|
|
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
|
</div><!-- fragment --><div class="dynheader">
|
|
Here is the call graph for this function:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.svg" width="327" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></li>
|
|
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.6 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|