"Maximum Circular Sum" from Challenges -Arrays

#1

I want to know if my approach is wrong. And yes then where and how.

#My Implementation
int main( ) {
int testlen;
std::cin>>testlen;
int len[testlen];
int *ptrArr[testlen];
for(int i=0;i<testlen;i++){
std::cin>>len[i];
int *a=new int[len[i]];
for(int j=0;j<len[i];j++){
std::cin>>a[j];
}
ptrArr[i]=a;
}

int max=0;
for(int i=0;i<testlen;i++){		
	for(int j=0;j<len[i];j++){			
		int count=0,sum=0,itr=j;

		while(count!=len[i]){				
			count++;
			sum+=*(ptrArr[i]+itr);
			itr++;
			if(sum<0){
				sum=0;
			}
			if(sum>max){
				max=sum;
			}
			if(itr==len[i]){
				itr=0;
			}
		}	
	}
	std::cout<<max<<"\n";
}	
return 0;

}