Cod sursa(job #2262161)
| Utilizator | Data | 17 octombrie 2018 00:57:18 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<cstdio>
using namespace std;
FILE *in=fopen("deque.in","r");
FILE *out=fopen("deque.out","w");
long long sum;
int n,k,x,deq[5000005],a[5000005],bottom,top;
int main(){
fscanf(in,"%d%d",&n,&k);
for(int i=1;i<=n;i++)
{
fscanf(in,"%d",&a[i]);
while(bottom<=top && a[i]<=a[deq[top]]) --top;
deq[++top]=i;
if(deq[bottom]==i-k) ++bottom;
if(i>=k) sum+=a[deq[bottom]];
}
fprintf(out,"%lld",sum);
}
