Pagini recente » Cod sursa (job #2762547) | Cod sursa (job #2675818) | Cod sursa (job #473838) | Cod sursa (job #1839806) | Cod sursa (job #1375053)
#include <fstream>
using namespace std;
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;
int contor ;
for (i=1;i<=n;i++)
{
suma = 0 ;
contor = 0;
for (j=i+1;j<=n;j++)
{
suma += v[j] ; contor++;
if (contor>=k)
{
if (suma > raspuns.maxim) {raspuns.maxim = suma ; raspuns.fin = j ; raspuns.inc = raspuns.fin - contor +1; }
}
}
}
out<<raspuns.inc<<" "<<raspuns.fin<<" "<<raspuns.maxim;
return 0;
}