Cod sursa(job #1805336)
Utilizator | Data | 13 noiembrie 2016 17:46:06 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
int n,s=0,x,i,bests=-1000000000,poz,poz1,poz2;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
if(s<0)
{
s=x;
poz=i;
}
else
s=s+x;
if(bests<s)
{
bests=s;
poz1=poz;
poz2=i;
}
}
fout<<bests<<" "<<poz1<<" "<<poz2;
fin.close();
fout.close();
return 0;
}