Cod sursa(job #3183916)
| Utilizator | Data | 13 decembrie 2023 18:13:01 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
int t[6000005];
int main()
{
long long int N,S=0,i,j=1,contor=0,Smax=0,finish,start;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>N;
for(i=1;i<=N;i++)
{
fin>>t[i];
}
S=0;
for(i=1;i<=N;i++)
{
if(S<0)
{
S=t[i];
j=i;
}
else
{
S=S+t[i];
}
if(S>Smax)
{
Smax=S;
finish=i;
start=j;
}
}
fout<<Smax<<' '<<start<<' '<<finish;
}
