Cod sursa(job #2920825)
| Utilizator | Data | 26 august 2022 11:00:15 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
using namespace std;
int x[5000002],v[5000002];
int main()
{
ifstream f("deque.in");
ofstream g("deque.out");
int i,j=1,n,z=0,k;
long long int s=0;
f>>n>>k;
for(i=1; i<k; ++i)
{
f>>x[i];
if(v[j]==i-k)
j++;
while(j<=z && x[i]<=x[v[z]])
z--;
v[++z]=i;
}
for(i=k; i<=n; ++i)
{
f>>x[i];
if(v[j]==i-k)
j++;
while(j<=z && x[i]<=x[v[z]])
z--;
v[++z]=i;
s=s+x[v[j]];
}
g<<s;
}
