Cod sursa(job #3288315)
| Utilizator | Data | 21 martie 2025 14:27:59 | |
|---|---|---|---|
| Problema | Deque | Scor | 15 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
struct cd
{
int val,p;
};
cd coada[5000001];
int v[5000001];
int main()
{
int n,k,inc=0,sf=0,s=0,n2;
cin>>n>>k;
for(n2=1;n2<=n;n2++)
{
cin>>v[n2];
while(v[n2]<coada[sf].val && sf>0)
{
sf--;
}
sf++;
coada[sf].val=v[n2];
coada[sf].p=n2;
if(coada[inc].p<n2-k+1)
{
inc++;
}
if(n2>=k)
{
s+=coada[inc].val;
}
}
cout<<s;
return 0;
}
