Cod sursa(job #664077)
Utilizator | Data | 19 ianuarie 2012 16:35:31 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int v[6000001],n;
int main()
{
int maxim,st,dr,i,s, p;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f.close();
maxim=v[1];
st=1;
dr=1;
p=1;
s=v[1];
if (s<0) {s=0;p=2;}
for(i=2;i<=n;i++)
{
s=s+v[i];
if(maxim<s) {maxim=s;st = p; dr=i;}
if(s<0) {s=0;p=i+1;}
}
g<<maxim<<" "<<st<<" "<<dr<<"\n";
g.close();
return 0;
}