Maximim subarray sum

#1

question code https://hack.codingblocks.com/contests/c/512/1259
my code
#include
using namespace std;
int issubset(long long int a[],long long int n){
long long int ms=0;
for (long long int i=0;i<n;i++){
long long int cs =0;
for (long long int j=i;j<n;j++){
if(cs<0){
cs=0;
}
cs += a[j];
ms = max(ms,cs);
}
}
return ms;
}
int main() {
long long int m;
cin>>m;
for (long long int i=0;i<m;i++){
long long int n;
cin>>n;
long long int a[100000000];
for (long long int i=0;i<n;i++){
cin>>a[i];
}
cout<<issubset(a,n)<<endl;
}
return 0;
}
showing time limit exceeded

#2

Hi Sarthak, there is no need of using two for loops in the issubset function.
I’ve modified the issubset function a little, go through it and let me know if you have any query.
https://ide.codingblocks.com/s/51612

1 Like