Cod sursa(job #1639584)
| Utilizator | Data | 8 martie 2016 12:55:33 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[6000002],i,pmin,p,q,smax,s,n;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
smax=a[i];
p=1;
q=1;
pmin=1;
for(i=2;i<=n;i++)
{
a[i]=a[i-1]+a[i];
s=a[i]-a[pmin];
if(s>smax)
{
smax=s;
p=pmin+1;
q=i;
}
if(a[i]<a[pmin])
{
pmin=i;
}
}
fout<<smax<<" "<<p<<" "<<q;
fin.close();
fout.close();
return 0;
}
