Mai intai trebuie sa te autentifici.
Cod sursa(job #1854830)
| Utilizator | Data | 23 ianuarie 2017 11:38:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
#define nmax 6000001
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[nmax],lg[nmax];
int main()
{
int n,i,smax,imax,s;
fin>>n;
for(i=1;i<=n;i++)fin>>a[i];
fin.close();
s=a[i];lg[1]=1;smax=s;imax=1;
for(i=2;i<=n;i++)
{
if(s>=0)
{s=s+a[i];lg[i]=lg[i-1]+1;
if(s>smax){smax=s;imax=i;}
else if(s==smax)
if(lg[i]<lg[imax])imax=i;
}
else
{
s=a[i];lg[i]=1;if(s>smax){smax=s;imax=i;}
}
}
fout<<smax<<" "<<imax-lg[imax]+1<<" "<<imax<<"\n";
fout.close();
return 0;
}
