Cod sursa(job #465508)
| Utilizator | Data | 24 iunie 2010 16:04:31 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
int v[1<<19],dq[1<<19],st=1,dr=0;
ifstream in("secventa.in");
ofstream out("secventa.out");
inline void s(int x)
{
if (dq[st]==x)
st++;
}
void d(int x)
{
while (v[dq[dr]]>=v[x] && dr)
dr--;
dq[++dr]=x;
}
int main()
{
int n,k,i,x,y,maxim=-(1<<15);
in>>n>>k;
for (i=1;i<=k;i++)
in>>v[i];
for (;i<=n;i++)
{
in>>v[i];
s(i-k);
d(i);
if (v[dq[st]]>maxim)
{
maxim=v[dq[st]];
x=dq[st];
y=i;
}
}
out<<x<<" "<<y<<" "<<maxim<<"\n";
return 0;
}
