Cod sursa(job #2178968)
Utilizator | Data | 19 martie 2018 21:04:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n, x, sc=0, smax=-1000000000,pi,pf,pii;
f>>n;pii=1;
for(int i=1;i<=n;i++)
{
f>>x;
sc=sc+x;
if(sc>smax) {
smax=sc;
pf=i;pi=pii;
}
if(sc<0)
{
sc=0;
pii=i+1;
}
}
g<<smax<<" "<<pi<<" "<<pf;;
return 0;
}