Can someone explain how the following two "same" codes give different verdicts in C++11 and C++14 ?? TLE Code in C++ 11 and AC Code in C++ 14
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | maroonrk | 155 |
6 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Can someone explain how the following two "same" codes give different verdicts in C++11 and C++14 ?? TLE Code in C++ 11 and AC Code in C++ 14
I have been thinking of an algorithm which could find the Sum Of Maximum's of all contigous sub-arrays of length k of a given Array. for each k from 1 to n , seperatly. n is the length of the array. I am able to figure out an O(N^2) solution. But could not reduce the complexity further. It would be helpful if someone could tell a sub-quadratic approach.(Possibly O(n) ). This is in reference to this problem. Any help is appreciated. NOTE : the answer for each k has to be printed seperately. Thanks :)
I am currently solving a problem on SPOJ on strongly connected components. I think i have figured out a correct algorithm for the problem. But i keep on getting SIGSEV ,perhaps the recursion is going to deep. I have'nt been able to figure out how the iterative version will look loke( the one i made up isn't giving correct output). It would be helpful if somene could share. PS : in refrence to http://www.spoj.com/problems/GOODA/ Thanks in advance.
Название |
---|