Cod sursa(job #936359)
Utilizator | Data | 6 aprilie 2013 20:10:17 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long a=-10000,nr,j,k,n,i,maxim=-10000,b,c;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>nr;
if(a+nr<nr)
{
a=nr;
j=i;
k=i;
}
else
{
a+=nr;
k++;
}
if(a>maxim)
{
maxim=a;
b=j;
c=k;
}
}
g<<maxim<<" "<<b<<" "<<c;
return 0;
}