public static void Main()
int[] someAr1 = {-1, 1, 1, -1, -1, -1,-1,-1, 0, 0, 1, 1, -1, -1, -1};
int[] someAr2 = {-1, 1, 1, -1, -1, -1, 0, 0, 1, 1, -1, -1, -1};
int[] someAr3 = {-1,-1,-1,-1};
int[] someAr4 = {0,0,0,0};
int[] someAr5 = {-1,-1,1,-1,-1};
Console.WriteLine(LongestPositiveSector(someAr1));
Console.WriteLine(LongestPositiveSector(someAr2));
Console.WriteLine(LongestPositiveSector(someAr3));
Console.WriteLine(LongestPositiveSector(someAr4));
Console.WriteLine(LongestPositiveSector(someAr5));
public static int LongestPositiveSector(int[] values)
int arLength = values.Length;
int[] sums = new int[arLength];
for (int i = 0; i < arLength; i++)
if (values[i] > 1 || values[i] < -1)
for (int j = 0; j <= i; j++)
if (sums[j] >= 0 && i - j + 1 > longest)