p497.cpp 1.7 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283
  1. #include <iostream>
  2. #include <list>
  3. #include <sstream>
  4. using namespace std;
  5. struct missile
  6. {
  7. int altitude;
  8. int length;
  9. list<missile>::iterator next;
  10. };
  11. int main()
  12. {
  13. int max = 0;
  14. list<missile> incoming;
  15. list<missile>::iterator longest, the_way;
  16. int test_cases;
  17. missile missile_entry;
  18. missile_entry.next = incoming.end();
  19. missile_entry.length = 1;
  20. string line;
  21. cin >> test_cases;
  22. cin.ignore();
  23. cin.ignore();
  24. for(int t = 0; t < test_cases; t++)
  25. {
  26. incoming.clear();
  27. max = 0;
  28. longest = incoming.end();
  29. while(getline(cin, line))
  30. {
  31. if(line.empty())
  32. break;
  33. istringstream iss_line(line);
  34. iss_line >> missile_entry.altitude;
  35. incoming.push_back(missile_entry);
  36. }
  37. for(auto i = incoming.end(); i != incoming.begin(); i--)
  38. {
  39. prev(i)->length = 1;
  40. for(auto y = i; y != incoming.end(); y++)
  41. {
  42. if((y->altitude > prev(i)->altitude) && ((y->length) >= prev(i)->length))
  43. {
  44. prev(i)->length = y->length + 1;
  45. prev(i)->next = y;
  46. }
  47. }
  48. if(prev(i)->length > max)
  49. {
  50. max = prev(i)->length;
  51. longest = prev(i);
  52. }
  53. }
  54. cout << "Max hits: " << max << endl;
  55. the_way = longest;
  56. while(the_way != incoming.end())
  57. {
  58. cout << the_way->altitude << endl;
  59. the_way = the_way->next;
  60. }
  61. if(t != test_cases-1)
  62. cout << endl;
  63. }
  64. return 0;
  65. }