/*Implementing Kadane's algorithm -finding the largest sum of a subarray in an array*/ #include using namespace std; int main() { int n;//to store array size int s=0;//storing sum of a subarray int max=-2147483648;//storing maximum sum of a subarray cin>>n; //Entering array size int a[n+1]; for(int i=0;i>a[i];} for(int i=0;imax) max=s; } cout