Cod sursa(job #2815343)
Utilizator | Data | 9 decembrie 2021 15:07:24 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
int n1,n,k,v[50001],j,i,maxi=-9999999,s,d;
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>n1;
v[i]=v[i-1]+n1;
}
for(i=0;i<=n-k;i++)
{
for(j=i+k;j<=n;j++)
{
if(v[j]-v[i]>maxi)
{
maxi=v[j]-v[i];
s=i;
d=j;
}
}
}
cout<<s+1<<" "<<d<<" "<<maxi;
return 0;
}