Cod sursa(job #1591630)
Utilizator | Data | 6 februarie 2016 15:08:25 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream>
#include <limits.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int v[50002],n,k,minim,maxim,i,poz,in,sf;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
v[i]+=v[i-1];
}
minim=INT_MAX;
maxim=INT_MIN;
poz=1;sf=1;in=1;
for(i=k;i<=n;i++)
{
if(v[i-k]<minim)
{
minim=v[i-k];
poz=i-k+1;
}
if(v[i]-minim>maxim)
{
maxim=v[i]-minim;
in=poz;
sf=i;
}
}
fout<<in<<" "<<sf<<" "<<maxim;
}