Cod sursa(job #1275407)
| Utilizator | Data | 25 noiembrie 2014 08:02:55 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <cstdio>
using namespace std;
int max1,min1,m1,m2,i,j,k,n,s[50001];
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&k);
max1=0;
min1=0;
m1=0;
m2=0;
for(i=1;i<=n;i++)
{
scanf("%d",&s[i]);
s[i]=s[i]+s[i-1];
if((max1<s[i])&&(i>=k))
{
m1=i;
max1=s[i];
}
}
for(i=1;i<=m1-k;i++)
if(min1>=s[i])
{
m2=i;
min1=s[i];
}
printf("%d %d %d",m2+1,m1,s[m1]-s[m2]);
return 0;
}
