public int findMaxContinue(int[] data) {
		int length = data.length;
		int numContinue = 1;
		int maxContinue = 0;
		int currentPtr = -1;
		for(int i = 1; i < length; ++i){
			if(data[i - 1] <= data[i]){
				numContinue++;
			}else{
				if(maxContinue < numContinue){
					maxContinue = numContinue;
					currentPtr = i - 1;
				}
				numContinue = 1;
			}
		}
		if(maxContinue < numContinue){
			maxContinue = numContinue;
			currentPtr = data.length - 1;
		}
		numContinue = 1;
		for(int i = 1; i < length; ++i){
			if(data[i - 1] >= data[i]){
				numContinue++;
			}else{
				if(maxContinue < numContinue){
					maxContinue = numContinue;
					currentPtr = i - 1;
				}
				numContinue = 1;
			}
		}
		if(maxContinue < numContinue){
			maxContinue = numContinue;
			currentPtr = data.length - 1;
		}
		int startPtr = currentPtr - maxContinue + 1;
		if(data[startPtr] > data[currentPtr])
			return currentPtr;
		else {
			return startPtr;
		}
	}