Cod sursa(job #716056)
| Utilizator | Data | 18 martie 2012 10:36:37 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,max=-999999,x,i,s=0,fi[10000],st[10000],k=0;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
s+=x;
if(s<0)
{
s=0;
st[++k]=i+1;
}
if(s>max)
{
max=s;
fi[k]=i;
}
}
fout<<max<<' '<<st[1]<<' '<<fi[1];
fin.close();
fout.close();
return 0;
}
