Cod sursa(job #3332526)
| Utilizator | Data | 7 ianuarie 2026 11:54:05 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include<fstream>
using namespace std;
int x[5000002],v[5000002];
long long int s=0;
main()
{
ifstream f("deque.in");
ofstream g("deque.out");
int i,start=1,n,stop=0,k;
f>>n>>k;
for(i=1; i<k; ++i)
{
f>>x[i];
while(start<=stop && x[i]<=x[v[stop]])
--stop;
v[++stop]=i;
}
for(i=k; i<=n; i++)
{
f>>x[i];
if(v[start]==i-k)
start++;
while(start<=stop && x[i]<=x[v[stop]])
--stop;
v[++stop]=i;
s+=x[v[start]];
}
g<<s;
}
