| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 111215 | 梁乃元 | 递增子序列 | C++ | Wrong Answer | 50 | 0 MS | 260 KB | 567 | 2023-11-18 21:55:01 |
# include <bits/stdc++.h> using namespace std ; int s [114514] ; bool chk ( int l , int r ) { for ( int i = l ; i < r ; i ++ ) { if ( s [i] > s [i + 1] ) { return false ; } } return true ; } int main ( ) { int n ; cin >> n ; for ( int i = 1 ; i <= n ; i ++ ) { cin >> s [i] ; } for ( int i = 1 ; i < n ; i ++ ) { for ( int j = i + 1 ; j <= n ; j ++ ) { if ( chk ( i , j ) ) { for ( int k = i ; k <= j ; k ++ ) { cout << s [k] << ' ' ; } cout << endl ; } } } return 0 ; }