Cod sursa(job #3195609)
Utilizator | Data | 21 ianuarie 2024 13:02:43 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int n,s[6000000],smax,inc,sf,cnt=0;
int v[6000000];
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
fin>>n;
for (int i=1;i<=n;i++)
{
fin>>v[i];
if(s[i-1]>=0)
{
s[i]=s[i-1]+v[i];
cnt++;
}
else
{
s[i]=v[i];
cnt=1;
}
}
for (int i=1;i<=n;i++)
{
if (smax<s[i])
{
smax=s[i];
inc=i-cnt+2;
sf=i;
}
}
fout<<smax<<' '<<inc<<' '<<sf;
return 0;
}