Pagini recente » Cod sursa (job #1063440) | Cod sursa (job #1522445) | Cod sursa (job #1269508) | Cod sursa (job #1753868) | Cod sursa (job #1051533)
#include <fstream>
using namespace std;
ifstream fin ( "secv2.in" ) ;
ofstream fout ( "secv2.out" ) ;
int n , k , secv[50001] , poz_inc , poz_sf , minim , best , i , x ;
int main()
{
fin >> n >> k ;
for ( i = 1 ; i <= n ; i ++ )
{
fin >> x ;
secv[i] = secv[i-1] + x ;
}
poz_sf = k ;
best = secv[k] ;
for ( i = 1 ; i <= n - k ; i ++ )
{
if ( secv[i] < minim )
{
minim = secv[i] ;
poz_inc = i ;
}
if ( secv[i+k] - minim > best )
{
best = secv[i+k] - minim ;
poz_sf = i + k ;
}
}
fout << poz_inc + 1 << " " << poz_sf << " " << best ;
return 0;
}