Cod sursa(job #2510053)

Utilizator euyoTukanul euyo Data 15 decembrie 2019 17:36:43
Problema Subsecventa de suma maxima Scor 85
Compilator c-64 Status done
Runda Arhiva educationala Marime 0.59 kb
#include <stdio.h>

int main() {
  FILE *fin = fopen( "ssm.in", "r" );
  FILE *fout = fopen( "ssm.out", "w" );
  int n, i, nr, st, dr, k;
  long long min, max, s;

  fscanf( fin, "%d%d", &n, &nr );
  min = k = st = dr = 0;
  max = nr;
  s = nr;
  for ( i = 1; i < n; ++i ) {
    fscanf( fin, "%d", &nr );
    s += nr;
    if ( min > s - nr ) {
      k = i;
      min = s - nr;
    }
    if ( max < s - min ) {
      dr = i;
      st = k;
      max = s - min;
    }
  }
  fprintf( fout, "%lld %d %d", max, st + 1, dr + 1 );
  fclose( fin );
  fclose( fout );
  return 0;
}