Cod sursa(job #2152487)
| Utilizator | Data | 5 martie 2018 16:35:16 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000000],i,j,smax,s,n,i1,j1;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
smax=-200000000;
for(i=1;i<=n;i++)
{
s=0;
for(j=i;j<=n;j++)
{
s=s+v[j];
if(s>smax)
{
smax=s;
i1=i;
j1=j;
}
}
}
fout<<smax<<" "<<i1<<" "<<j1;
fin.close();
fout.close();
return 0;
}
