Cod sursa(job #705993)
| Utilizator | Data | 5 martie 2012 12:04:50 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
#define dim 5000001
#define inf 0x3f3f3f
int stiva[dim];
int v[dim];
int main()
{
ifstream fin("deque.in");
ofstream fout("deque.out");
int n, i, st=1, vf=0, k;
long long suma=0;
fin>>n >>k;
for(i=1;i<=n;++i)
{
fin>>v[i];
while(st<=vf && v[i]<=v[stiva[vf]])--vf;
stiva[++vf]=i;
if(i-stiva[st]>=k)
++st;
if(i>=k)
suma+=v[stiva[st]];
}
fout<<suma;
return 0;
}