Cod sursa(job #2613741)
| Utilizator | Data | 10 mai 2020 16:30:00 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<bits/stdc++.h>
using namespace std;
int main(){
ifstream f("in.txt");
ofstream f1("out.txt");
int n,k;
f>>n>>k;
cout<<n<<k;
int v[n];
int suma=0;
for (int i=0;i<n;i++){
f>>v[i];
cout<<v[i];
}
cout<<endl;
int deq[n*k];
int st=0,dr=0;
for (int i=0;i<n;i++){
cout<<st<<dr;
while (st<dr && +deq[st]>v[i])
dr--;
dr++;
deq[dr]=v[i];
if (i>k){
if (deq[dr]=v[i-k-1])
dr--;
}
suma+=deq[dr];
for (int j=st;j<dr;j++)
cout<<deq[j]<<" ";
cout<<endl;
}
cout<<suma;
f1<<suma;
}
