Maximum subarray sum problem

#include
#include
using namespace std;
int maxno(int a[],int size) {
int cs=INT_MIN;
int ms=0;
for(int i=0;i<size;i++){
cs=cs+a[i];
if(ms<cs){
ms=cs;
}
if(cs<0){
cs=0;
}
ms=max(cs,ms);
}
return ms;
}
int main(){
int t;
cin>>t;

for(int j=0;j<t;j++){
	
int n;
cin>>n;
int a[n];

for(int i=0;i<n;i++){
	cin>>a[i];
}
int max_sum=maxno(a,n);
cout<<max_sum<<endl;
}
return 0;

}

@piyush_sharma
Use long long instead of int
initialise
ms = INT_MIN
cs = 0

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.