#include <cstdio> #include <string> #include <list> using namespace std; int main() { int n = -1; int k = -1; int c = 0; int x = 0; int y = 0; list<int> d; bool first = true; scanf("%d %d", &n, &k); for (int i = 0; i < n; i++) { scanf("%d", &x); if(first) d.push_front(x); else { if (x >= d.front()) { d.push_front(x); } else { d.push_back(x); } } first = false; } x = d.front(); d.pop_front(); for (int i = 1; i < n; i++) { y = d.front(); d.pop_front(); if (x == y) k++; x = y; } printf("%d", k); return 0; }
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 | #include <cstdio> #include <string> #include <list> using namespace std; int main() { int n = -1; int k = -1; int c = 0; int x = 0; int y = 0; list<int> d; bool first = true; scanf("%d %d", &n, &k); for (int i = 0; i < n; i++) { scanf("%d", &x); if(first) d.push_front(x); else { if (x >= d.front()) { d.push_front(x); } else { d.push_back(x); } } first = false; } x = d.front(); d.pop_front(); for (int i = 1; i < n; i++) { y = d.front(); d.pop_front(); if (x == y) k++; x = y; } printf("%d", k); return 0; } |