Pagini recente » Cod sursa (job #1034549) | Monitorul de evaluare | Cod sursa (job #1657066) | Cod sursa (job #2073246) | Cod sursa (job #1585847)
#include <iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
int main()
{
long nmax=5000000;
long long x[nmax],i,j,n,s, suma, minim;
ifstream f1("deque.in");
ofstream f2("deque.out");
f1>>n>>s;
cout << "n=" << n<< "s=" <<s << endl;
i=0;
while (f1>>x[i])
{
cout << x[i] << endl;
i++;
}
suma=0;
for (i=0; i<=n-s; i++)
{
minim=x[i];
for (j=0;j<s;j++)
{
if (minim>x[i+j])
minim=x[i+j];
}
suma+=minim;
}
f2<<suma;
}