Cod sursa(job #1373633)
Utilizator | Data | 4 martie 2015 19:48:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a1, a2, n, ok, l, i,q, i1, i2;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
fin>>ok;
l=ok;
for(i=2; i<=n; i++)
{
fin>>ok;
a2=max(a1+ok, ok);
if(a2==ok) q=i;
if(a2>l) {l=a2; i2=i;i1=q; }
a1=a2;
}
fout<<l<<" "<<i1<<" "<<i2;
return 0;
}