Pagini recente » Cod sursa (job #344878) | Cod sursa (job #2182432) | Cod sursa (job #2292026) | Cod sursa (job #434390) | Cod sursa (job #1375016)
#include <fstream>
using namespace std;
int Cursi ;
int main()
{
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int n,k,i,j ;
struct L {int maxim=-250001 ; int inc=0 ; int fin=0 ;};
L raspuns ;
in >> n >> k ;
int v[n+1];
for (i=1;i<=n;i++) in >> v[i] ;
int suma=0,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 > raspuns.maxim) {raspuns.maxim = suma ; raspuns.fin = j ; raspuns.inc = raspuns.fin - contor ; }
}
}
}
out<<raspuns.inc<<" "<<raspuns.fin<<" "<<raspuns.maxim;
in.close();
out.close();
return Cursi;
}