Cod sursa(job #1124671)
Utilizator | Data | 26 februarie 2014 13:09:38 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
int n,i,s,bestsum=-2000000000,x[6000003],f,l,idx;
using namespace std;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x[i];
if(s<0)
{
s=x[i]; idx=i;
}
else
s=s+x[i];
if(bestsum<s)
{
bestsum=s;
f=idx;
l=i;
}
}
fout<<bestsum<<" "<<f<<" "<<l<<"\n";
fout.close();
return 0;
}