why ami i getting Tle .... Question — Your text to link here...
My Soln -Your text to link here...
Please Help....
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
7 | Petr | 147 |
7 | atcoder_official | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
why ami i getting Tle .... Question — Your text to link here...
My Soln -Your text to link here...
Please Help....
Name |
---|
You took ptr1 and ptr2 but essentially what you are doing is equivalent to this.. ll books=0; for(int i=1;i<=n;++i){ ll count=0LL,sum=0LL; for(int j=i+1;j<=n;++j,++count){ if(sum+a[j]>t)
break; sum+=a[j]; } books=max(books,count); }
This has time complexity of O(n^2) so with large values of n you end up getting a TLE.. Instead you can try something like this.. You can have two pointers left and right; initially both are 1; keep incrementing right till sum+a[right]>t; at that point you can increment left and subtract a[left(before increment)] from sum and continue the process..