Cod sursa(job #3163896)
| Utilizator | Data | 1 noiembrie 2023 16:31:48 | |
|---|---|---|---|
| Problema | Secventa | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream cin("secventa.in");
ofstream cout("secventa.out");
int n,k,i,dq[500005],v[500005],st,dr,secvst,secvdr,sol=INT_MIN;
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
while(dq[st]<=i-k&&st<=dr)
st++;
while(v[dq[dr]]>=v[i]&&st<=dr)
dr--;
dq[++dr]=i;
if(i>=k&&v[dq[st]]>sol)
{
sol=v[dq[st]];
secvst=i-k+1;
secvdr=i;
}
}
cout<<secvst<<" "<<secvdr<<" "<<sol;
return 0;
}
