Cod sursa(job #2076858)
| Utilizator | Data | 27 noiembrie 2017 11:41:29 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,s[50005],k;
int i,mini,maxi,in,fi;
int main()
{ fin>>n>>k;
fi=k; in=1;
for(i=1;i<=n;++i)
{
fin>>s[i];
// fout<<s[i]<<" ";
s[i]+=s[i-1];
}
maxi=s[k];
mini=0;
for(i=k;i<=n;++i)
{ if(s[mini]>s[i-k])
mini=i-k;
else if(s[i]-s[mini]>maxi)
{maxi=s[i]-s[mini];
in=mini+1;
fi=i;
}
}
fout<<in<<" "<<fi<<" "<<maxi;
return 0;
}
