what is the wrong with it. I have used few inputs on this board and it was ok. Pls help.minimum value
{
i=last item that is found (and matched) before the mid value.
j=first item that is found (and matched) after the mid value.
if(i>(total length-j))minimum=i;
else minimum=total length-j;
}
maximum value
{
i=the smallest item of the array.
j=the largest item of the array.
if((total length -i)>j)
maximum=total length-i;
else maximum=j;
}
Code: Select all
int findMin()
{
int i;
int min = L;
int mid = L/2; /*This is the mid of pole*/
/**mid theke shobcheye kaser ant khojo**/
/**Let's find which ant is closest to the mid position****/
/*STEP 1: Search Left side upto mid**/
for(i=0; a[i]<mid; i++)
{
if(min> abs(a[i]-mid))
min = abs(a[i]-mid);
}
/*STEP 2: Search from Right side upto mid**/
for(i=N-1; a[i]>=mid; i--)
{
if(min>abs(a[i]-mid))
min = abs(a[i]-mid);
}
return mid-min; /*This is the minimum distance, isn't it?*/
}
Code: Select all
int findMax()
{
int i,j;
int max=-1;
/***
i=the smallest item of the array.
j=the largest item of the array.
if((total length -i)>j)
maximum=total length-i;
***/
i = a[0];
j = a[N-1];
if((L-i)>j)
max= L-i;
else
max= j;
return max;
}
Could someone plz give me the I/O.What if hold==distance?unaben wrote:I got W.A on this problem.
your code wrote:.......if(hold<distance and hold>min)
.......{
...........min = hold;
.......}....
.......else if(hold>distance and distance>min)
.......{
...........min = distance;
.......}...
I think your findMin() doesn't work for odd Ls. Think about something like that:rahurprem wrote:I'm getting WA in this problem. I'm sending my findMin() & findMax() code blocks. I hope until now that those two blocks are producing correct results. So help me in this matter.
Code: Select all
1
3 1
3
What a stupid mistake. I got AC now 
After you got AC, please, remove the code from your first post, so there won't be too many spoilers hereunaben wrote:Thanx Macko
Code: Select all
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<list>
#include<queue>
#include<cctype>
#include<stack>
#include<map>
#include<set>
using namespace std;
int main()
{
int cases;
cin>>cases;
while(cases--)
{
int l,n;
scanf(" %d %d",&l,&n);
vector<int> v(n);
for(int i=0;i<n;i++)
{
scanf(" %d",&v[i]);
}
sort(v.begin(),v.end());
int ma=max(l-v[0],v.back());
int mi=ma;
for(int i=0;i<n-1;i++)
{
mi=min(mi,max(v[i],l-v[i+1]));
}
if(n==1)
mi=min(v[0],l-v[0]);
printf("%d %d\n",mi,ma);
}
return 0;
}
Could anyone provide me with I/0?Code: Select all
1
10 3
3 7 9
Code: Select all
3 9
Code: Select all
3 8