Maximum Connectivity sub-array

#include <iostream>using namespacestd;#defineLength1 3#defineLength2 5//* * * * Find the maximum * * *intLargest (intList[],intlength) {    inti,max=list[0];  for(i=0; i<length;i++)    {        if(list[i]>max) {Max=List[i]; }    }    returnMax;}intMainintargcChar*argv[]) {    intMax1,max2,i; intLIST1[LENGTH1];//={10,22,62,45,28,0,-78,-5,3,10};    intLIST2[LENGTH2];//={-5,-4,-3,-2,-1};cout<<"Please enter"<<length1<<"Number:";  for(intI=0; i<length1;i++) Cin>>List1[i]; cout<<"Please enter"<<length2<<"Number:";  for(i=0; i<length2;i++) Cin>>List2[i]; Max1=largest (LIST1,LENGTH1); Max2=largest (LIST2,LENGTH2); cout<<endl<<"List1:";  for(i=0; i<length1;i++) cout<<list1[i]<<" "; cout<<endl<<"Maximum value:"<<max1<<Endl; cout<<"List2:";  for(i=0; i<length2;i++) cout<<list2[i]<<" "; cout<<endl<<"Maximum value:"<<max2<<endl<<Endl; return 0;}

Maximum Connectivity sub-array