Pagini recente » Cod sursa (job #3190110) | Cod sursa (job #654488) | Cod sursa (job #216800) | Cod sursa (job #2693112) | Cod sursa (job #2483309)
#include<bits/stdc++.h>
#define all(s) s.begin(),s.end()
#define rc(x) return cout<<x<<endl,0
#define forn(i,n) for(int i=0;i<int(n);i++)
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const int nmax=1e6+3;
const int mod=998244353;
const ll inf=0x3f3f3f3f3f3f3f3f;
using namespace std;
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
ios_base::sync_with_stdio(0); cin.tie(0);
int n,k;
cin>>n>>k;
int dp[50003],a[50003];
for(int i=1;i<=k;i++)
{
cin>>a[i];
dp[i]=a[i]+dp[i-1];
}
int sol=dp[k],st=1,dr=k;
int aux=sol,x=st,y=dr;
for(int i=k+1;i<=n;i++)
{
cin>>a[i];
dp[i]=a[i]+dp[i-1];
if(dp[i]-dp[i-k]>aux+a[i]) aux=dp[i]-dp[i-k],x=i-k+1; else aux+=a[i],y++;
if(aux>sol) sol=aux,st=x,dr=i;
}
cout<<st<<" "<<dr<<" "<<sol;
}