fork download
  1. #include <iostream>
  2. #include <vector>
  3.  
  4. using namespace std;
  5.  
  6. int n;
  7. vector<int> arr;
  8.  
  9. int findlong(int index) {
  10. int max = 0;
  11. int count = 1;
  12. for (int j = index + 1; j < arr.size(); j++) {
  13. int pre = arr[index];
  14. for (int i = j; i < arr.size(); i++) {
  15. if (arr[i] > pre) {
  16. count++;
  17. pre = arr[i];
  18. }
  19. }
  20. if (count > max) {
  21. max = count;
  22. }
  23. count = 1;
  24. }
  25. return max;
  26. }
  27.  
  28. int main() {
  29. cin >> n;
  30. for (int i = 0; i < n; i++) {
  31. int k;
  32. cin >> k;
  33. arr.push_back(k);
  34. }
  35. int max = 0;
  36. for (int i = 0; i < n; i++) {
  37. if (max <= findlong(i)) {
  38. max = findlong(i);
  39. }
  40. }
  41. if (n == 1) {
  42. cout << 1 << endl;
  43. }
  44. else {
  45. cout << max << endl;
  46. }
  47.  
  48. return 0;
  49. }
  50.  
Success #stdin #stdout 0.01s 5356KB
stdin
6
1 5 2 6 3 4
stdout
3