[16:14, 2/19/2022] Horia: #include <stdio.h>
int v[1000];
int n, i, j, k;
int sum, S, st, dr;
int main()
{
     FILE *f = fopen ("secv.in","r");
     fscanf (f,"%d", &n);
     for (i=1; i<=n; ++i)
         fscanf (f,"%d", &v[i]);
     fclose(f);
     for (i=1; i<=n; ++i)
     {
         for (j=n; j>=1; --j)
         {
             sum = 0;
             for (k=i; k<=j; ++k)
                 sum += v[k];
             if (sum > S)
             {
                 S = sum;
                 st = i;
                 dr = j;
             }
       }
    }
    printf ("Suma maxima = %d\n", S);
    printf ("Pozitia de inceput a secventei %d , pozitia se sfarsit a secventei %d", st, dr);

     return 0;
}