Maximum Subarray Sum o(n)

 

How do you find the maximum sum of a Subarray?

How do you find the maximum sum?

How do I print Max Subarray?

What is maximum circular sum?

Maximum Subarray Sum o(n)

#include<bits/stdc++.h>

using namespace std;

int main()

{

    int n,i,sum=0,ans=0;

   cin>>n;

   int a[n];

   for(i=0;i<n;i++) cin>>a[i];

   for(i=0;i<n;i++)

   {

       sum+=a[i];

       sum=max(a[i],sum);

       ans=max(ans,sum);

   }

    cout<<ans<<endl;

    return 0;

}