Cod sursa(job #2191508)
Utilizator | Data | 2 aprilie 2018 22:02:45 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
int main()
{
int n,k,sum=0,a;
cin>>n>>k;
int vec[n+1];
vec[0]=0;
for(int i=1; i<n; i++)
{
cin>>a;
sum+=a;
vec[i]=sum;
}
int first,last,rf,rl,maxx=-2000000000;
for(first=0; first+k<=n; first++)
{
for(last=first+k-1; last<=n; last++)
{
sum=vec[last]-vec[first];
if(sum>=maxx)
{
maxx=sum;
rf=first;
rl=last;
}
}
}
cout<<rf+1<<" "<<rl+1<<" "<<maxx;
return 0;
}