Pagini recente » Cod sursa (job #2063795) | Cod sursa (job #2300387) | Cod sursa (job #2136215) | Cod sursa (job #3193415) | Cod sursa (job #2956477)
#include <fstream>
using namespace std;
const int N = 50000;
const int INF = 2e9;
int v[N+1];
int main()
{
ifstream in("secv2.in");
ofstream out("secv2.out");
int n, k, sc = -1, sk = 0, smax = -INF, p = 1, stmax, drmax;
in >> n >> k;
for (int i = 1; i <= n; i++)
{
in >> v[i];
sk += v[i];
if (i > k)
{
sk -= v[i-k];
}
if (sk > sc + v[i])
{
sc = sk;
p = i - k + 1;
}
else
{
sc += v[i];
}
if (i >= k && sc > smax)
{
smax = sc;
stmax = p;
drmax = i;
}
}
out << stmax << " " << drmax << " " << smax;
in.close();
out.close();
return 0;
}