Cod sursa(job #2122055)
Utilizator | Data | 4 februarie 2018 16:31:16 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <bits/stdc++.h>
#include <climits>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,sum=INT_MIN,v[50001],vi,vf,p;
int main()
{f>>n>>k;
for(i=1;i<=n;i++)f>>v[i],v[i]+=v[i-1];
for(i=k;i<=n;i++)
{if(v[p]>v[i-k])p=i-k;if(v[i]-v[p]>sum) sum=v[i]-v[p],vi=p+1,vf=i;}
g<<vi<<" "<<vf<<" "<<sum;
return 0;
}