using System;

using System.Collections;

using System.Collections.Generic;

using System.Linq;

public class Program

{

    public static void Main()

    {

        int nombreReference = 2;

        int [] arrayTest1 = new int[]{-5, 7, 5, 4, -7, -1, 10};

    }

    public List<Sol> Test(int[] array, int nbRef)

    {

        int arrayLenght = array.Length;

        int indexDebut = 0;

        int indexFin = 0;

        List<Sol> solutions = new List<Sol>();

        if (array != null && arrayLenght != 0)

        {

            if (arrayLenght == 1)

            {

                solutions.Add(new Sol {

                    IndexDebut = 0,

                    IndexFin = 0,

                });

                return solutions;

            }

            for (indexDebut = 0; indexDebut < arrayLenght; indexDebut++)

            {

                for (indexFin = indexDebut + 1; indexFin < arrayLenght; indexFin++)

                {

                    Sol sol = new Sol(indexDebut, indexFin, nbRef, array.ToList());

                    solutions.Add(sol);

                }

            }

        }

        IComparer comparer = new BestSolComparer();

        return solutions.OrderByDescending(x => x, comparer).ToList<Sol>();

    }

    public class Sol

    {

        public int IndexDebut { get; set; }

        public int IndexFin { get; set; }

        public int NbRef { get; set; }

        List<int> Numbers = new List<int>();

        public int Delta { get 

        {

            return GetDelta();

        }}

        public int Longueur { 

            get { return (IndexFin - IndexDebut) + 1 ;} 

        }

        public Sol(){}

        public Sol(int indexDebut, int indexFin, int nbRef, List<int> numbers)

        {

            Numbers = numbers;

            IndexDebut = indexDebut;

            IndexFin = indexFin;

            NbRef = nbRef;

        }

        private int GetDelta()

        {

            return NbRef - (Numbers.Take(Numbers.Count).Sum());

        }

    }

    // best sol => delta = 0 && longueur max (index fin - index début)

    public class BestSolComparer: IComparer

    {

        public int Compare(Object x, Object y)  

        {

            Sol sol1 = x as Sol;

            Sol sol2 = y as Sol;

            //to implement

            return -1;

        }

    }

}