Pagini recente » Cod sursa (job #70744) | Cod sursa (job #2220778) | Cod sursa (job #2201776) | Simulare 31a | Cod sursa (job #1151570)
#include <fstream>
using namespace std;
int v[50001], sum[50001];
int main()
{
ifstream in("secv2.in");
ofstream out("secv2.out");
int n, k, i, sc = 0, stc, smax, stmax, drmax, poz;
in >> n >> k;
in >> v[1];
sum[1] = v[1];
for ( i = 2; i <= n; i++ )
{
in >> v[i];
sum[i] = sum[i-1] + v[i];
}
smax = sum[k];
stmax = 1;
drmax = k;
stc = 1;
for ( i = k; i <= n; i++ )
{
poz = i;
while( poz <= n )
{
sc = sum[poz] - sum[i-k];
if ( sc > smax )
{
smax = sc;
stmax = i - k+1;
drmax = poz;
}
poz++;
}
}
out << stmax <<' '<< drmax<< ' '<< smax;
return 0;
}