Cod sursa(job #2168374)
| Utilizator | Data | 14 martie 2018 10:37:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s,smax,lgmax,lg,pmax;
int x;
int n;
void read()
{
fin>>n;
int i;
for(i=1;i<=n;++i)
{
fin>>x;
if(s>=0)
{
s+=x;
lg++;
if(s>smax)
{
smax=s;
lgmax=lg;
pmax=i;
}
}
else
{
s=x;
lg=1;
if(s>smax)
{
smax=s;
lgmax=lg;
pmax=i;
}
}
}
fout<<smax<<" "<<pmax-lgmax+1<<" "<<pmax;
}
int main()
{
read();
return 0;
}
