Cod sursa(job #1524847)
| Utilizator | Data | 14 noiembrie 2015 14:59:11 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream in ("ssm.in");
ofstream out("ssm.out");
int n,x;
int main()
{ in>>n;
int suma=0,maxim=-INT_MAX,minim=0,prim,ultim,p=0;
for(int i=1;i<=n;i++)
{in>>x;
suma+=x;
if(suma-minim>maxim)
{maxim=suma-minim;
ultim=i;
prim=p+1;}
if(suma<minim)
{minim=suma;
p=i;}
}
out<<maxim<<' '<<prim<<' '<<ultim;
in.close();
out.close();
return 0;
}
