제출 #1108917

#제출 시각아이디문제언어결과실행 시간메모리
1108917csibe_csavoGlobal Warming (CEOI18_glo)C++14
28 / 100
2067 ms3136 KiB
#include <algorithm> #include <bits/stdc++.h> using namespace std; int n,d; int lis(vector<int> &v) { vector<int> s{v[1]}; for(int i=2; i<=n; i++) { int ind=lower_bound(s.begin(),s.end(),v[i])-s.begin(); if(ind>=s.size()) s.push_back(v[i]); else s[ind]=v[i]; } int p=s.size(); return p; } int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>n>>d; vector<int> v(n+1); for(int i=1; i<=n; i++) cin>>v[i]; int ans=lis(v); for(int i=1; i<n; i++) { v[i]-=d; ans=max(ans,lis(v)); } cout<<ans<<"\n"; }

컴파일 시 표준 에러 (stderr) 메시지

glo.cpp: In function 'int lis(std::vector<int>&)':
glo.cpp:11:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |   if(ind>=s.size()) s.push_back(v[i]);
      |      ~~~^~~~~~~~~~
#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...