Cod sursa(job #663907)
| Utilizator | Data | 19 ianuarie 2012 09:47:44 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
int a[6000002];
int main()
{
int N,i,s,st,dr,maxim;
ifstream fin("ssm.in");
fin>>N;
s=0;
maxim=a[1];
if(s>a[1]) s=0;
st=dr=1;
for (i=1;i<=N;i++)
{
fin>>a[i];
}
fin.close();
for (i=2;i<=N;i++)
{
st=i+1;
s=s+a[i];
if(s>maxim)
{
maxim=s;
dr=i;
}
if(s<0) s=0;
}
ofstream fout("ssm.out");
fout<<maxim<<" "<<st<< " "<<dr;
fout.close();
return 0;
}
