Topic description
Given an array a[0,...,n-1], find its largest subarray (length>=1) and
enter description
The first line is an integer n (1<=n<=5000), and then input n integers in sequence (each integer range [-5000, 5000])
output description
output an integer representing the largest subarray and
sample input
5 1 -1 1 1 -1
Sample output
2
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n = 0;
do{
cin>>n;
}while(n<1||n>5000);
vector<int>arr(n);
for(int i=0;i<n;i++){
do{
cin>>arr[i];
}while(arr[i]<-5000||arr[i]>5000);
}
int sum=0;
int max=0;
for(int i=0;i<arr.size();i++){
sum = 0;
for(int j=i;j<arr.size();j++){
sum+=arr[j];
if(sum>max)
max=sum;
}
}
cout<<max<<endl;
return 0;
}