Subsequence Maximal Sum (Exercise)

using System;
using System.Collections.Generic;
using System.Linq;

namespace ConsoleTesting2
{
    class ConsoleTesting2
    {
        static void Main()
        {
            int n = int.Parse(Console.ReadLine());
            var ints = new int[n];
            var sequences = new List<string>();
            var sums = new List<int>();

            for (int i = 0; i < n; i++)
            {
                Console.Write("Index \"{0}\": ", i);
                ints[i] = int.Parse(Console.ReadLine());
            }

            for (int i = 0; i < n; i++)
            {
                var templist = new List<int>();
                templist.Add(ints[i]);
                int count = ints[i];

                for (int j = i+1; j < n; j++)
                {
                    count += ints[j];
                    sums.Add(count);
                    templist.Add(ints[j]);
                    string temp = string.Join(",",templist);
                    sequences.Add(temp);
                }
            }

            Console.WriteLine(sums.Max());

        }
    }
}