use segment tree
http://en.wikipedia.org/wiki/Segment_tree
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@g
#include
int main()
{
int arr[11]={0},sum2[1001]={0};
int type[1001]={0};//0 for tails
int N,Q,i,j,sum;
int a,b,c;
scanf("%d",&N);
scanf("%d",&Q);
for(i=0;ihttp://groups.google.com/group/algogeeks?hl=en.
see TC forums :
On Wed, Dec 8, 2010 at 10:44 PM, ankit sablok wrote:
> please help mewritea program for this problem to reduce the time limit
>
> http://www.codechef.com/problems/FLIPCOIN/
>
> thnx in advance i have ben banging my head on this for a full day
>
> --
> You received this message bec
please help mewritea program for this problem to reduce the time limit
http://www.codechef.com/problems/FLIPCOIN/
thnx in advance i have ben banging my head on this for a full day
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to t
