Submission #1214714

#TimeUsernameProblemLanguageResultExecution timeMemory
1214714tamzidGlobal Warming (CEOI18_glo)C++20
0 / 100
2097 ms1860 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> using ll = long long; #define pb push_back #define F first #define S second #define vii vector<int> #define vl vector<long long> #define cinv(v) for (auto &it : v) cin >> it; #define coutv(v) for (auto &it : v) cout << it << " "; cout << '\n'; #define dbg_var(x,y) cout<<y<<"# Debugging: "<<x<<'\n'; using namespace std; //using namespace __gnu_pbds; //template<class T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; void solve() { int n,k; cin>>n>>k; vector<int> v(n); cinv(v); vector<int> dp(n,1); int ans = 1; for(int i=1;i<n;++i) { for(int j=0;j<i;++j) { if(v[j] < v[i]) dp[i] = max(dp[i],dp[j]+1); } ans = max(dp[i],ans); } cout<<ans<<'\n'; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); //int t;cin>>t;while(t--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...