Cod sursa(job #1400629)
Utilizator | Data | 25 martie 2015 13:02:31 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, x, i, p=1, u, pmax, s, smax=-213123121;
int main()
{ f>>n;
for (i=1;i<=n;i++)
{ f>>x;
s=s+x;
if(s>smax) {smax=s; u=i; pmax=p; }
else if (s<0) {s=0; p=i+1; }
}
g<<smax<<' '<<pmax<<' '<<u;
return 0;
}