Cod sursa(job #1548131)
Utilizator | Data | 10 decembrie 2015 16:18:26 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,m,i,mx,mn,i1,i0,x,s;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
f>>n;
mn=+1000000;
mx=-1000000;
i0=1;
i1=1;
for(i=1;i<=n;i++)
{
f>>x;
s+=x;
if(s<mn)
{
mn=s;
i0=i;
}
if(s>mx)
{
mx=s;
i1=mx;
}
}
if(mn<0)
g<<mx-mn<<" "<<i0+1<<" "<<i1-1;
else
g<<mx<<" "<<i0+1<<" "<<i1-1;
}