SPOJ Solution (in c++)

Copy the code to your IDE for better reading then read the explanations from comment lines in code. Also please send your feed-backs.  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 //NAME:- ANUHAR TRIPATHI //COLLEGE:- JAYPEE UNIVERSITY OF ENGINEERING & TECHNOLOGY, GUNA //EMAIL:- anuhartripathi15@gmail.com //SPOJ Problem:- HORRIBLE - Horrible Queries # include < bits / stdc ++ .h > # define ll long long using namespace std; vector < ll > tree( 800050 ); //,kk=0; vector < ll > lazy( 800050 ); /*In update function I have avoided updating whole tree, if in any case a node with all its children needs to be updated then I do not go to its children for update,

Read the comment for explanation. You can remove the unnecessary comments. Copy the code to your IDE for better reading then read the explanations from comment lines in code. Also please send your feed-backs.  You can see youtube video of "Tushar Roy" on knapsack problem.  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 //NAME:- ANUHAR TRIPATHI //COLLEGE:- JAYPEE UNIVERSITY OF ENGINEERING & TECHNOLOGY, GUNA //EMAIL:- anuhartripathi15@gmail.com //SPOJ Problem:- PARTY - Party Schedule # include < bits / stdc ++ .h > # define ll long long using namespace std; int main () { ll b,n,i,fee,fun; cin >> b >> n; while (b != 0 || n != 0 ) { ll a[n + 2 ][b + 3 ]; for (i = 0 ;i < b + 1 ;i ++ ) {a[ 0 ][i +

Read the comment for explanation & don't worry code is not that long. You can remove the code from line no.:- 76 to 109, it's for checking my code only. Copy the code to your IDE for better reading. Also please send your feed-backs.  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 //NAME:- ANUHAR TRIPATHI //COLLEGE:- JAYPEE UNIVERSITY OF ENGINEERING & TECHNOLOGY, GUNA //EMAIL:- anuhartripathi15@gmail.com //SPOJ Problem:- GSS1 - Can you answer these queries I # include < bits / stdc ++ .h &