Submission #736639

#TimeUsernameProblemLanguageResultExecution timeMemory
736639OlympiaZoltan (COCI16_zoltan)C++17
7 / 140
644 ms7128 KiB
#include <iostream> #include <set> #include <cmath> #include <queue> #include <vector> #include <cstdlib> #include <ctime> #include <cmath> #include <algorithm> #include <cassert> #include <map> #include <deque> using namespace std; const int MX = 20; int64_t lis_length[MX]; int64_t lis_number[MX]; pair<int,int> lis (vector<int> v) { lis_length[0] = 1, lis_number[0] = 1; for (int i = 1; i < v.size(); i++) { lis_length[i] = 1, lis_number[i] = 1; for (int j = 0; j < i; j++) { if (v[j] < v[i]) { if (lis_length[j] + 1 > lis_length[i]) { lis_length[i] = lis_length[j] + 1; lis_number[i] = lis_number[j]; } else if (lis_length[j] + 1 == lis_length[i]) { lis_number[i] += lis_number[j]; } } } } int64_t mx = 0, cnt = 0; for (int i = 0; i < v.size(); i++) { if (lis_length[i] > mx) { mx = lis_length[i]; cnt = lis_number[i]; } else if (lis_length[i] == mx) { cnt += lis_number[i]; } } return make_pair(mx, cnt); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } int64_t mx = 0, cnt = 0; for (int i = 0; i < (1 << n); i += 2) { deque<int> d; for (int j = 0; j < n; j++) { if (i & (1 << j)) { d.push_back(v[j]); } else { d.push_front(v[j]); } } vector<int> vec; for (int i: d) { vec.push_back(i); } auto p = lis(vec); if (p.first == mx) { cnt += p.second; } else if (p.first > mx) { mx = p.first, cnt = p.second; } } cout << cnt << " " << mx << '\n'; }

Compilation message (stderr)

zoltan.cpp: In function 'std::pair<int, int> lis(std::vector<int>)':
zoltan.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for (int i = 1; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~
zoltan.cpp:33:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for (int i = 0; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...