Cod sursa(job #1585851)
Utilizator | Data | 31 ianuarie 2016 15:42:11 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
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;
i=0;
while (f1>>x[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;
}