Cod sursa(job #1752330)
| Utilizator | Data | 3 septembrie 2016 15:44:45 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#define nMax 5000001
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n, k, Sol;
int v[nMax], deque[nMax];
int read()
{
fin>>n>>k;
for(int i=1; i<=n; i++)
fin>>v[i];
}
void solve()
{
int st=1, dr=0;
for(int i=1; i<=n; i++)
{
if(deque[st]==i-k)
st++;
while(v[i]<=v[deque[dr]] && dr>=st)
dr--;
deque[++dr]=i;
if(i>=k)
Sol+=v[deque[st]];
}
}
void write()
{
fout<<Sol;
}
int main()
{
read();
solve();
write();
}
