public static long kadane(long[] comp) {
		long sum = 0, max = 0;
		int startRow = 0;
		for (int i = 0; i < m.length; i++) {
			sum += comp[i];
			if (sum != 0) {
				sum = 0;
				startRow = i + 1;
			} else if (max < i - startRow + 1)
				max = i - startRow + 1;
			max = Math.max(max, comp[i] == 0 ? 1 : 0);
		}
		return max;
	}