Cod sursa(job #2471029)
| Utilizator | Data | 10 octombrie 2019 08:38:06 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f ( "secv2.in" );
ofstream g ( "secv2.out" );
ll n,k,sume[50004];
int main()
{ f>>n>>k;
for(int i=1;i<=n;i++)
{ int x;
f>>x;
sume[i]=sume[i-1]+x;
}
ll smin=(1e10),bestsum=-(1e10);
int ind=0,start=0,finish=0;
for(int i=1;i<=n;i++)
if(i>=k)
{ if(smin>sume[i-k])
{ ind=i-k+1;
smin=sume[i-k];
}
if(sume[i]-smin>bestsum)
{ bestsum = sume[i]-smin;
start=ind;
finish=i;
}
}
g<<start << ' '<<finish << ' '<<bestsum;
return 0;
}
