Cod sursa(job #658875)
Utilizator | UAIC-Padurariu-Cristian federer | Data | 9 ianuarie 2012 19:04:10 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
long long best1, best2, i, n, k, M=-100000000, poz, a, pozi, pozf;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a;
if(a>best1+a)
{
best2=a;
poz=i;
}
else
best2=best1+a;
if(M<best2)
{
M=best2;
pozi=poz;
pozf=i;
}
best1=best2;
}
fout<<M<<' '<<pozi<<' '<<pozf<<'\n';
fin.close();
fout.close();
return 0;
}