Cod sursa(job #1499171)
| Utilizator | Data | 10 octombrie 2015 12:09:31 | |
|---|---|---|---|
| Problema | Deque | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#define Nmax 500010
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
int v[Nmax],Deque[Nmax];
int main()
{
int n,k;
int top=0,bottom=0;
long long sum=0;
in>>n>>k;
for(int i=1;i<=n;i++) in>>v[i];
for(int i=1;i<=n;i++)
{
in>>v[i];
while(top> bottom && v[i] < v[Deque[top-1]]) top --;
Deque[top++]=i;
if(Deque[bottom]==i-k) bottom++;
if(i>=k) sum+=v[Deque[bottom]];
}
out<<sum;
return 0;
}
