Maximum subarray sum problem maximum subarray sum problem

#1
#2

i am using kadanes algo which is the best optimised approach i learn in the lectures unusual error comes i dont understand how i get the rid of my mistake pls help me in this question

#3

hey @dipeshgupta197 initilize ms = A[0] it will run for all the case weather positive or negative

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

#5

https://ide.codingblocks.com/s/625184 is this is fine i made again in other way

#6

but yet it is not running on hackerblocks does nt pass the test cases

#7

hey @dipeshgupta197 please see this code here you are taking input in wrong format


your implementation part is correct

#8

you write t-- why we may write t>0 also we have to specify terminating condition
or we use unsigned int t i guess

#9

yes i am looking for the same didn’t understand why it is given wrong answer

#10

#include
using namespace std;
int main()
{
int n;
cin>>n;
int arr[1000];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int ms=arr[0];
int cs=0;
for(int i=1;i<n;i++)
{
cs=cs+arr[i];
ms=max(cs,ms);
}
cout<<ms<<endl;
return 0;
}
in this way u said ms=a[0] why sir jabb mein i=0 se start karunga tooo current sum mein mere a[0] negative hoo ya positive voo tooo include hooraha hein

#11

yes yes and dont initilize arr size instead take arr[n].

#12

one more condition if(cs<0) then cs=0;

#13

i ask kya zarrurat hein ki maximum sum ko a[0] se initialize karru sir

#14

yes but in case all element are negative it will give ms as 0 if you initilize ms = 0 in begining

#15

#include
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int ms=arr[0];
int cs=0;
for(int i=0;i<n;i++)
{
cs=cs+arr[i];
if(cs<0)
cs=0;
ms=max(cs,ms);
}
cout<<ms<<endl;
return 0;
}
i understand aapne bolla sarrein element negative hoo too maximum sum zero hooga
cs=0 bhi intialize karraha huin aur maximum of cs and ms leraha huin aaesa bhi too hoosakta hein ki a[0] prr zada negative vala no ho aur kisi aur a[i] prr kamm negative tabb and if valli condition cs=kabhi negative nhi banne deggi

#16

I GUESS MORE BETTER APPROACH TO INCLUDE ALL THE CASES IS WHETHER ALL ELEMENTS ARE NEGATIVE OR POSITIVE OR BOTH IS THE PREVIOUS U CORRECTED THE INPUT FORMAT WHERE WE TAKE MAX_SO_FAR=INT_MIN;