Pagini recente » Borderou de evaluare (job #1195200) | Cod sursa (job #466401) | Cod sursa (job #2102903) | Cod sursa (job #1751904) | Cod sursa (job #540794)
Cod sursa(job #540794)
#include<stdio.h>
using namespace std;
int s[6000008],n,i,j,max,p,u,k;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
scanf("%d",&k);
max=-2000000000;
for(i=k;i<=n;i++)
{
for(j=1;j<=i-k;j++)
{
if(max<s[i]-s[j])
{
max=s[i]-s[j];
p=i;
u=j;
}
}
}
printf("%d ",max);
printf("%d ",u);
printf("%d",p);
return 0;
}