Cod sursa(job #1777463)
Utilizator | Data | 12 octombrie 2016 15:22:19 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("nr.in");
ofstream fout("nr.out");
int v[805];
int N,s,d,mij,x,n;
int main()
{
fin>>x;
fin>>n;
for(int i=0;i<n;i++)
{
fin>>v[i];
}
s=1;
d=n;
while(s<=d)
{
mij=(s+d)/2;
if(v[mij]>x)
d=mij-1;
else if(v[mij]==x)
{
fout<<mij;
break;
}
else
s=mij+1;
}
//fout<<x;
}