Cod sursa(job #3000613)
Utilizator | Data | 12 martie 2023 17:26:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[6000001];
int main()
{
int st,dr,Smax=-2000000000,S=-1,start,n;
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
for(int i=1;i<=n;++i)
{
if(S<0)
S=0,start=i;
S+=v[i];
if(S>Smax)
Smax=S,st=start,dr=i;
}
g<<Smax<<endl;
g<<st<<" "<<dr;
return 0;
}