Cod sursa(job #1411313)
| Utilizator | Data | 31 martie 2015 16:58:21 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.9 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,a[6000002],i,sum,sumtot,x,ok,xf,q=0,yf;
int main()
{
fin >> n;
for(i = 1; i <= n; i++)
fin >> a[i];
fin.close();
sum=sumtot=ok=0;
for(i = 1; i <= n; i++)
{
sum+=a[i];
if(sum >= 0)
{
if(q == 0)
x = i;
q = 1;
if(sum >= sumtot)
{
sumtot = sum;
ok = 1;
xf=x;
yf = i;
}
}
else
ok=q=sum=0;
}
if(!sumtot)
{
sumtot =-999999;
for(i=1; i<=n; i++)
if(a[i]>sumtot)
{
sumtot=a[i];
xf=yf=i;
}
}
fout << sumtot<<" "<< xf<<" "<<yf<<"\n";
fout.close();
return 0;
}
