제출 #1006363

#제출 시각아이디문제언어결과실행 시간메모리
1006363vjudge1Rabbit Carrot (LMIO19_triusis)C++17
0 / 100
0 ms348 KiB
#include <iostream> #include <algorithm> #include <vector> using namespace std; int main() { int n,m; cin >> n >> m; int a[n],t,ans=1; for(int i=0; i<n; i++) { cin >> t; a[i]=t-i*m-m; } vector<int>b; vector<int>c; for(int i=0; i<n; i++) { if(a[i]>0) { ans++; continue; } if(b.size()==0){ b.push_back(0); c.push_back(-a[i]); continue; } b.push_back(int(2e9)); c.push_back(-a[i]); } for(int i=0; i<b.size(); i++) { b[upper_bound(b.begin(),b.end(),a[i])-b.begin()]=c[i]; } for(int i=b.size()-1; i>=0; i--) { if(b[i]<int(2e9)) { cout << i+ans; return 0; } } cout << ans-1; }

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

triusis.cpp: In function 'int main()':
triusis.cpp:32:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for(int i=0; i<b.size(); 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...