Cod sursa(job #670794)
Utilizator | Balog Adrian micutuz | Data | 30 ianuarie 2012 10:18:28 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream>
#include<fstream>
#define DN 6000005
using namespace std;
int n, max, min, s=0, x, mins, prim, ultim;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
max=-DN;
for(int i=1;i<=n;i++)
{
fin>>x;s+=x;
if(s-mins>max)
{
prim=min+1;
ultim=i;
max=s-mins;
}
if(s<mins)
{
min=i;
mins=s;
}
}
fout<<s<<" "<<prim<<" "<<ultim;
}