Pagini recente » Cod sursa (job #2888503) | Cod sursa (job #219034) | Cod sursa (job #516649) | Cod sursa (job #2965832) | Cod sursa (job #1274626)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
const int NMax = 500010;
const int CMax = 5000002;
int v[NMax],deq[NMax];
char nr[NMax];
void chg()
{
int semn,j;
j = 1;
for(int i = 0; nr[i] != 0; i++){
semn = 1;
if(nr[i] == '-'){
semn = -1;
i++;
}
while(nr[i] >= '0' && nr[i] <= '9'){
v[j] = v[j] * 10 + nr[i] - '0';
i++;
}
v[j] = v[j] * semn;
j++;
}
}
int main()
{
int N,K,fata,spate,bmn = -NMax,pz;
f >> N >> K;
f.get();
f.getline(nr,CMax);
chg();
for(int i = 1; i <= N; i++)
g << v[i] << " ";
/*fata = 1;
spate = 0;
for(int i = 1; i <= N; i++){
while(fata <= spate && v[i] <= v[deq[spate]])
spate--;
deq[++spate] = i;
if(deq[fata] == i-K)
fata++;
if(i >= K && v[deq[fata]] > bmn){
bmn = v[deq[fata]];
pz = i;
}
}
g << pz - K + 1 << " " << pz << " " << bmn;*/
return 0;
}