Cod sursa(job #3159300)
Utilizator | Data | 21 octombrie 2023 08:52:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
long long int v[6000001], S, i, j, smax, n, start, y, x;
int main()
{
fi>>n;
for(i=1; i<=n; i++)
fi>>v[i];
S=-1;
smax=-1000000001;
for(i=1; i<=n; i++)
{
if(S<0)
{
S=0;
start=i;
}
S=S+v[i];
if(S>smax)
{
smax=S;
x=start;
y=i;
}
}
fo<<smax<<" "<<x<<" "<<y;
}