Cod sursa(job #696941)
Utilizator | Data | 28 februarie 2012 21:03:58 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int s=0,smax=-(int)2e9,n,x,in,inm,sfm;
f>>n;
for(int i=1;i<=n;i++)
{
f>>x;
if(s<0)
{
s=x;
in=i;
}
else
{
s+=x;
}
if(s>smax)
{smax=s;inm=in;sfm=i;
}
}
g<<smax<<" "<<inm<<" "<<sfm;
return 0;
}