Cod sursa(job #1893580)
Utilizator | Data | 25 februarie 2017 19:51:09 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int DQ[5000001];
int main()
{
int n,t,i,st,dr,x;
long long sol = 0;
fin>>n>>t;
st = 0;
dr = 1;
for(i=1;i<=n;i++)
{
fin>>x;
if(dr-st+1 == t)
st++;
while(x<DQ[dr] && dr>st)
dr--;
DQ[++dr] = x;
if(i>=t)
sol+=DQ[st];
}
fout<<sol;
return 0;
}