Hi Here is the code . I want to optimize it to run faster .
Can Anyone help me???
#includestdio.h
void main()
{
int n,q,a[10]={0},b[10],c[10],d[10],i,count,j;
scanf(%d%d,n,q);
for(i=0;iq;i++) scanf(%d%d%d,b[i],c[i],d[i]);
for(i=0;iq;i++)
if(b[i]==0)
{
Can you give an insight to what exactly this code does? That may help quiet
a lot.
Regards,
Sandeep Jain
On Sun, Jul 3, 2011 at 1:17 PM, rajeevrvis rajeev.open.1...@gmail.comwrote:
Hi Here is the code . I want to optimize it to run faster .
Can Anyone help me???
#includestdio.h
void
You should have posted the problem link
i think u are trying this one. http://www.codechef.com/problems/MULTQ3/
http://www.codechef.com/problems/MULTQ3/use RMQ or Binary Indexed Trees.
Brute Force won't work
On Sun, Jul 3, 2011 at 1:17 PM, rajeevrvis rajeev.open.1...@gmail.comwrote:
Hi Here
