Cod sursa(job #957863)
| Utilizator | Data | 6 iunie 2013 10:41:19 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a[6000007],i,b[6000007],sum,ii,inc,sf,nr;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
sum=a[1];
for(i=1;i<=n;i++)
{
b[i]=a[i];
ii=i;
if(b[i]<b[i-1]+a[i])
{
nr++;
b[i]=b[i-1]+a[i];
}
if(sum<b[i])
{
sum=b[i];
inc=ii;
sf=i;
}
}
inc=sf-nr+2;
g<<sum<<" "<<inc<<" "<<sf;
}
