Pagini recente » Cod sursa (job #446936) | Cod sursa (job #1818474) | oji-9-10-1 | Cod sursa (job #2222639) | Cod sursa (job #1935950)
#include <fstream>
#include <math.h>
using namespace std;
fstream f1("secv2.in", ios::in);
fstream f2("secv2.out", ios::out);
const long int inf=200000;
long int n, k, s[50001], i, x, j, maxi=-inf, in, sf, mini[50001], p[50001];
int main()
{
f1>>n>>k;
for(i=1; i<=n; i++)
{
f1>>x;
s[i]=x+s[i-1];
if(s[i]>mini[i-1]) {mini[i]=mini[i-1];p[i]=p[i-1];}
else {mini[i]=s[i];p[i]=i;}
}
for(i=k; i<=n; i++)
{
if(s[i]-mini[i-k]>maxi) {maxi=s[i]-mini[i-k]; in=p[i-k]+1; sf=i;}
}
f2<<in<<" "<<sf<<" "<<maxi;
return 0;