Cod sursa(job #3268390)

Utilizator lucky1992Ion Ion lucky1992 Data 14 ianuarie 2025 21:40:49
Problema Subsecventa de suma maxima Scor 70
Compilator java Status done
Runda Arhiva educationala Marime 1.09 kb
import java.io.*;
import java.util.StringTokenizer;

public class Main {
  public static void main(String[] args) throws IOException {
    try (BufferedReader reader = new BufferedReader(new FileReader("ssm.in"));
         BufferedWriter writer = new BufferedWriter(new FileWriter("ssm.out"))) {
      int N = Integer.parseInt(reader.readLine());
      int[] a = new int[N+1];

      StringTokenizer st = new StringTokenizer(reader.readLine());
      for (int i = 1; i <= N; i++) {
        a[i] = Integer.parseInt(st.nextToken());
      }

//      int[] best = new int[N+1];
//      best[1] = a[1];

      int sum = a[1];
      int maxSum = sum;
      int first = 1;
      int start = 1;
      int end = 1;

      for (int i = 2; i <= N; i++) {
        if (sum >= 0) {
          sum += a[i];
          //best[i] = a[i] + best[i-1];
        } else {
          sum = a[i];
//          best[i] = a[i];
          first = i;
        }

        if (sum > maxSum) {
          maxSum = sum;
          start = first;
          end = i;
        }
      }

      writer.write(maxSum + " " + start + " " + end);
    }
  }
}