Pagini recente » Cod sursa (job #157169) | Cod sursa (job #388828) | Cod sursa (job #2604498) | Cod sursa (job #1696256) | Cod sursa (job #256830)
Cod sursa(job #256830)
#include <fstream.h>
int n,k,poz,a[50000],p,q,i,j;
long s[50000],max=-12500000;
void cit()
{
int i;
ifstream fin("secv2.in");
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a[i];
s[i]=a[i]+s[i-1];
if(s[i]>max && i>=k)
{
max=s[i];
p=1; q=i;
}
}
fin.close();
}
int main()
{
cit();
/*for(i=2;i<n;i++)
for(j=i+k-1;j<=n;j++)
if(s[j]-s[i-1]>max)
{
max=s[j]-s[i-1];
p=i;
q=j;
} */
poz=1;
j=1;
for(i=k+1;i<=n;i++)
{
if(s[i]-s[poz]>max)
{
max=s[i]-s[poz];
p=poz+1;
q=i;
}
j++;
if(s[j]<s[poz])
poz=j;
}
ofstream fout("secv2.out");
fout<<p<<" "<<q<<" "<<max;
fout.close();
return 0;
}