Cod sursa(job #1623741)
| Utilizator | Data | 1 martie 2016 21:23:18 | |
|---|---|---|---|
| Problema | Secventa | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
long k,n,i,j;
int mini=999999,maxi=-999999,prim, doi;
int a[500001];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)f>>a[i];
for(i=1;i<=n-k+1;i++){
for(j=i;j<i+k;j++){
//cout<<a[j]<<" ";
if(a[j]<mini) {
mini=a[j];
//cout<<mini<<" ";
}
}
if(mini>maxi) {
maxi=mini;
prim=i;
doi=i+k-1;
}
mini=999999;
//cout<<'\n';
}
cout<<sizeof a;
g<<prim<<" "<<doi<<" ";
g<<maxi;
//<<maxi;
return 0;
}
