Pagini recente » Cod sursa (job #1865873) | Cod sursa (job #2524562) | Cod sursa (job #2127603) | Cod sursa (job #3149230) | Cod sursa (job #24325)
Cod sursa(job #24325)
#include<iostream.h>
#include<fstream.h>
main()
{
long int a[100000],n,i,j,k,l,m,s,max,ind1,ind2;
fstream f("secv2.in",ios::in);
fstream g("secv2.out",ios::out);
f>>n;
f>>k;
for(i=1;i<=n;i++)
f>>a[i];
i=1;
while(a[i]<0)
{
i++;
}
max=a[i];
s=a[i];
i++;
ind1=1;
while(i<=n)
{
s+=a[i];
if(s<=0){ s=0;
ind1=i+1;
}
else
{
if(s>max){
max=s;
ind2=i;
}
}
i++;
}
//cout<<endl<<"i1 = "<<ind1;
//cout<<endl<<"i2 = "<<ind2;
//cout<<endl<<"Max= "<<max;
g<<ind1<<" ";
g<<ind2<<" ";
g<<max;
f.close();
g.close();
return 0;
}