Cod sursa(job #3207264)
Utilizator | Branea Tudor Branea | Data | 25 februarie 2024 17:39:33 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
int n, A[6000001];
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int st , dr, Smax = -2000000000 , S = -1, start;
fin>>n;
for (int i = 1; i <= n; i++)
fin>>A[i];
for(int i = 1 ; i <= n ; ++ i)
{
if(S < 0)
S = 0, start = i;
S += A[i];
if(S > Smax)
Smax = S, st = start, dr = i;
}
fout << Smax << ' ';
fout << st << ' ' << dr;
}