Cod sursa(job #1012409)
| Utilizator | Data | 18 octombrie 2013 21:56:21 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
int a[6000010];
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,smax=INT_MIN,s=0,k=0,y,maxk;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
s+=a[i];
if(s>smax)
smax=s,y=i,maxk=k;
if(s<0)
s=0,k=0;
k++;
}
fout<<smax<<" "<<y-maxk+1<<" "<<y;
return 0;
}
