Cod sursa(job #664674)
Utilizator | Data | 20 ianuarie 2012 17:31:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int a[6000001];
int main ()
{
int n,i,s,st,dr,maxim ;
ifstream fin("ssm.in");
fin>>n ;
for (i=1; i<=n; i++)
fin>>a[i];
fin.close();
s=a[1];
maxim=a[1];
st=dr=1;
for (i=2; i<=n; i++)
{
s=s+a[i];
if (s>maxim) {maxim=s; dr=i;}
if (s<0) { s=0; st=i+1;}
}
ofstream fout("ssm.out");
fout<<maxim<<" "<<st<<" "<<dr<<"\n";
fout.close();
return 0;
}