Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int v[10001],poz[10001];
- int n,x = 1,k;
- int maxBooks, firstDay, Day = 1;
- int main() {
- cin >> n;
- for(int i = 1; i <= n; i++) {
- cin >> v[i];
- poz[v[i]] = i;
- }
- for(int i = 1; i < n; i ++) {
- for(int j = i+1; j <= n; j++) {
- if(v[i] > v[j])
- swap(v[i],v[j]);
- }
- }
- for(int i = 1; i <= n; i++) {
- if(poz[v[i]] > poz[v[i-1]]) {
- k++;
- }
- else {
- if(k > maxBooks) maxBooks = k,firstDay=Day;
- Day++;
- k = 1;
- }
- }
- cout << Day << ' ' << firstDay << ' ' << maxBooks;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement