Cod sursa(job #1955573)
| Utilizator | Data | 6 aprilie 2017 08:13:55 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, p, i, l, lmax, pmax;
long long s, smax, x;
int main()
{
f>>n;
p=1;
for(i=1;i<=n;++i)
{
f>>x;
s+=x, l++;
if(s<0) s=0, p=i+1, l=0;
else if(s>smax) pmax=p, smax=s, lmax=l;
}
if(s>smax) pmax=p, smax=s, lmax=l;
g<<smax<<" "<<pmax<<" "<<pmax+lmax-1<<"\n";
return 0;
}
