1 #include<bits/stdc++.h>
 2 using namespace std;
 3
 4 int a[10005];
 5 int main()
 6 {
 7     int n;
 8     cin >> n;
 9     for(int i = 1;i <= n;i ++){
10         cin >> a[i];
11     }
12     int ans = 0;
13     int now = 1;
14     while(now <= n){
15         int maxx = a[now];
16         while(now != maxx){
17             now ++;
18             maxx = max(a[now],maxx);
19         }
20         now ++;
21         ans ++;
22     }
23     cout << ans << endl;
24
25     return 0;
26 }

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3
 4 char a[10005];
 5 int main()
 6 {
 7     int T;
 8     cin >> T;
 9     while(T --){
10         int n;cin >> n;
11         scanf("%s",a);
12         for(int i = 0;i < n;i ++){
13             if(a[i] == '>'){cout << i << endl;break;}
14             if(a[n - i - 1] == '<'){cout << i << endl;break;}
15         }
16     }
17
18     return 0;
19 }

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3
 4 struct Node{
 5     int L;int H;
 6     friend bool operator<(Node a,Node b){return a.L > b.L;}
 7 }a[300005];
 8
 9 bool cmp(Node a,Node b){
10     if(a.H == b.H){return a.L < b.L;}
11     return a.H > b.H;
12 }
13
14 int main()
15 {
16     int n,m;
17     cin >> n >> m;
18     for(int i = 0;i < n;i ++){
19         cin >> a[i].L >> a[i].H;
20     }
21     sort(a,a + n,cmp);
22     priority_queue<Node> Q;
23 //    for(int i = 0;i < n;i ++){
24 //        cout << a[i].L << " " << a[i].H << endl;
25 //    }
26     long long sum = 0;
27     long long ans = 0;
28     for(int i = 0;i < n;i ++){
29         Q.push(a[i]);
30         sum += a[i].L;
31         if(Q.size() > m){
32             sum -= Q.top().L;
33             Q.pop();
34         }
35         //cout << a[i].H << " " << sum <<endl;
36         ans = max(ans,sum * a[i].H);
37     }
38     cout << ans << endl;
39
40     return 0;
41 }

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3
 4
 5 int main()
 6 {
 7     int n;
 8     cin >> n;
 9     long long ans = 0;
10     for(int i = 2;i <= n - 1;i ++){
11         ans += i * i + i;
12     }
13     cout << ans << endl;
14
15     return 0;
16 }