Cod sursa(job #1916353)
Utilizator | Data | 9 martie 2017 09:11:26 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
///se da un vector de n numere intregi sa determ o secventa de suma maxima
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int maxi=-2000000000,n,i,sc=0,i1=1,j1,x;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
sc=sc+x;
if(sc>maxi)
{
maxi=sc;
j1=i;
}
if(sc<0)
{
sc=0;
i1=i+1;
}
/*if(sc<0)
{
sc=0;
i1=i+1;
}*/
}
fout<<maxi<<" "<<i1<<" "<<j1;
return 0;
}