Cod sursa(job #1375562)
Utilizator | Data | 5 martie 2015 13:37:52 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
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 n,i,k,s,smax,x,pozi,pozf;
int main()
{
fin>>n;
fin>>smax;
s=smax;
k=1;
for(i=2;i<=n;i++)
{
fin>>x;
s+=x;
k++;
if(s>smax)
{
smax=s;
pozi=i-k;
pozf=i;
}
if(s<0)
{
k=0;
s=0;
}
}
fout<<smax<<" "<<pozi+1<<" "<<pozf<<endl;
return 0;
}