Mai intai trebuie sa te autentifici.
Cod sursa(job #2382166)
Utilizator | Data | 17 martie 2019 20:01:17 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | java | Status | done |
Runda | Arhiva educationala | Marime | 0.98 kb |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] v = new int[n];
int[] dp = new int[n];
int max = 0;
for(int i = 0; i < n ; i++) {
v[i] = sc.nextInt();
}
dp[0] = v[0];
// caz general
for (int i = 1; i < n; ++i) {
if (dp[i - 1] >= 0) {
// extinde la dreapta cu v[i]
dp[i] = dp[i - 1] + v[i];
} else {
// incep o noua secventa
dp[i] = v[i];
}
}
// solutia e maximul din vectorul dp
int sol = dp[0];
int stopIndex = 0;
for (int i = 1; i < n; ++i) {
if (dp[i] > sol) {
sol = dp[i];
stopIndex = i;
}
}
int startIndex = stopIndex;
int sum = 0;
while(startIndex != -1 && dp[stopIndex] != sum) {
sum+=v[startIndex];
startIndex--;
}
startIndex+=2;
stopIndex+=1;
System.out.println(sol+ " " + startIndex + " " + stopIndex);
}
}