Cod sursa(job #1311739)
| Utilizator | Data | 8 ianuarie 2015 15:56:56 | |
|---|---|---|---|
| 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;
int n, x, s, smax, pp, ppmax, upmax, i;
int main ()
{
ifstream f ("ssm.in");
ofstream g ("ssm.out");
f>>n;
smax=-2147483647;
for (i=1;i<=n;++i){
f>>x;
s=s+x;
if (s>smax){
smax=s;
ppmax=pp;
upmax=i;
}
if (s<0){
pp=i+1;
s=0;
}
}
g<<smax<<" "<<ppmax<<" "<<upmax;
f.close();
g.close();
return 0;
}
