Cod sursa(job #1606377)
Utilizator | Data | 20 februarie 2016 10:47:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
long n,v[6000000],pozi,i,s,poz=1,mx=-9999,pozf;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for (i=1;i<=n;i++)
{
f>>v[i];
if (s<0) {s=v[i];poz=i;}
else s=s+v[i];
if (s>mx) {mx=s; pozi=poz; pozf=i;}
}
g<<mx<<" "<<pozi<<" "<<pozf;
return 0;
}