Cod sursa(job #1060885)
| Utilizator |  David Andrei andrei1235 |
Data | 18 decembrie 2013 21:07:08 |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("degue.out");
int main()
{
int a[100],b[50],i,n,k,j=1,s=0,min;
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
while(k<=n)
{
min=a[j];
for(i=j;i<=k;i++)
{
if(a[i]<min)
min=a[i];
}
s=s+min;
j++;
k++;
}
g<<s;
}