Pagini recente » Cod sursa (job #2944105) | Cod sursa (job #1902374) | Monitorul de evaluare | Cod sursa (job #1898631) | Cod sursa (job #1375083)
#include <fstream>
using namespace std;
int main()
{
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int n,k,i,j ;
int maxim=-250001,inc=0,fin=0 ;
in >> n >> k ;
int v[n+1];
for (i=1;i<=n;i++) in >> v[i] ;
int suma,k2 ;
int contor = -1 ;
for (i=1;i<=n;i++)
{ k2 = k ;
suma = 0 ;
contor = -1;
for (j=i+1;j<=n;j++)
{
suma += v[j] ; k2--; contor++;
if (k2<=0)
{
if (suma > maxim) {maxim = suma ; fin = j ; inc = fin - contor ; }
}
}
}
out<<inc<<" "<<fin<<" "<<maxim;
return 0;
}