Cod sursa(job #1585909)
Utilizator | Data | 31 ianuarie 2016 16:22:07 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f1("deque.in");
ofstream f2("deque.out");
long x[500000],n,s,suma,minim;
long long i,j;
f1>>n>>s;
i=0;
while (f1>>x[i])
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;
return 0;
}