Cod sursa(job #1315497)
| Utilizator | Data | 12 ianuarie 2015 20:58:26 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include<fstream>
using namespace std;
int a[5000010],dq[5000010],n,k;
long long sol;
void citire()
{
ifstream fin("deque.in");
fin>>n>>k;
for(int i=1;i<=n;++i)
fin>>a[i];
fin.close();
}
void solve()
{
int pr=0,ul=-1,i;
for(i=1;i<=n;++i)
{
while(pr<=ul && a[i]<=a[dq[ul]])
--ul;
dq[++ul]=i;
if(dq[pr]==i-k)
++pr;
if(i>=k)
sol+=a[dq[pr]];
}
ofstream fout("deque.out");
fout<<sol<<"\n";
fout.close();
}
int main()
{
citire();
solve();
return 0;
}
