Cod sursa(job #3244117)
Utilizator | Data | 23 septembrie 2024 18:03:09 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
#define mod 100003
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
int main()
{
int i,s,smax,dr,l,st,x;
fin>>n;
s=0;
smax=INT_MIN;
l=0;
for(i=1;i<=n;i++)
{
fin>>x;
s+=x;
l++;
if(s>smax)
{
smax=s;
dr=i;
st=i-l+1;
}
if(s<0)
{
s=0;
l=0;
}
}
fout<<smax<<" "<<st<<" "<<dr;
return 0;
}