Cod sursa(job #1535064)
| Utilizator | Data | 24 noiembrie 2015 11:48:20 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,s,i,j,inc,sfar,smax;
int v[2000000];
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
for(i=1;i<=n;i++)
{
s=v[i];
if(s>smax)
{
smax=s;
inc=i;
sfar=i;
}
j=i+1;
for(j<=n;j++;)
{
s=s+v[j];
if(s>smax)
{
smax=s;
inc=i;
sfar=j;
}
}
}
fout<<smax<<" "<<inc<<" "<<sfar;
}
