SPOJ Solution (in c++)

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 //NAME:- ANUHAR TRIPATHI //COLLEGE:- JAYPEE UNIVERSITY OF ENGINEERING & TECHNOLOGY, GUNA //EMAIL:- anuhartripathi15@gmail.com //SPOJ Problem:- D-query # include < bits / stdc ++ .h > # define ll long long # define bb 555 using namespace std; class node { public: ll l,r,i; }; bool cmp (node x, node y) { if (x.l / bb != y.l / bb) return x.l / bb < y.l / bb; //else if(x.l==y.l) return x.r < y.r; } int main () { ll n,m; cin >> n; ll a[n],i; for (i = 0 ;i < n;i ++ )cin >> a[i]; //memset(a,0,sizeof(a)/sizeof(a[0])); cin >> m; n

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 //NAME:- ANUHAR TRIPATHI //COLLEGE:- JAYPEE UNIVERSITY OF ENGINEERING & TECHNOLOGY, GUNA //EMAIL:- anuhartripathi15@gmail.com //SPOJ Problem:- GSS3 - Can you answer these queries III # include < bits / stdc ++ .h > # define ll long long using namespace std; class node { public: ll suf,pre,result,sum; }tree[ 131080 ]; ll a[ 131080 ]; void build (ll l, ll r, ll pos) { if (l == r) { tree[pos].sum = tree[pos].pre = tree[pos].suf = tree[pos].result = a[l]; return ; } ll mid = (l + r) / 2 ; build(l,mid,pos * 2 ); build(mid + 1 ,r,po

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 +