Cod sursa(job #414786)
| Utilizator | Data | 10 martie 2010 15:45:11 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<fstream>
#include<iostream>
#include<queue>
using namespace std;
#define NMax 500000
#define INF 0x3f3f3f3f
ifstream f("secventa.in");
ofstream g("secventa.out");
queue<int>Q;
int maxim=-30005;
int poz,p,n,k;
void read()
{
f>>n>>k;
for(int i=1;i<=n-k+1;i++)
{
f>>p;
if(p>maxim)
{
maxim=p;Q.push(p);poz=i;
}
}
}
int main()
{
read();
g<<poz<<' '<<k+poz-1<<' '<<Q.back();
f.close();
g.close();
return 0;
}
