#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
int t[200000];
vi v[3];
int main() {
int i;
int n,x;
scanf("%d %d",&n,&x);
for (i = 0; i < n; i++) scanf("%d",&t[i]);
int d;
int ans = 0;
for (d = -x; d <= x; d++) {
v[0].pb(t[0]),v[1].pb(min(t[0],t[0]+d)),v[2].pb(min(t[0],t[0]+d));
for (i = 1; i < n; i++) {
int p = lower_bound(v[0].begin(),v[0].end(),t[i])-v[0].begin();
if (p == v[0].size()) v[0].pb(t[i]);
else v[0][p] = t[i];
if ((p >= v[1].size()) || (v[0][p] < v[1][p])) {
if (p >= v[1].size()) v[1].pb(0);
v[1][p] = v[0][p];
}
p = lower_bound(v[1].begin(),v[1].end(),t[i]+d)-v[1].begin();
if (p == v[1].size()) v[1].pb(t[i]+d);
else v[1][p] = t[i]+d;
if ((p >= v[2].size()) || (v[1][p] < v[2][p])) {
if (p >= v[2].size()) v[2].pb(0);
v[2][p] = v[1][p];
}
p = lower_bound(v[2].begin(),v[2].end(),t[i])-v[2].begin();
if (p == v[2].size()) v[2].pb(t[i]);
else v[2][p] = t[i];
}
ans = max(ans,(int) v[2].size());
v[0].clear(),v[1].clear(),v[2].clear();
}
printf("%d\n",ans);
return 0;
}
Compilation message
glo.cpp: In function 'int main()':
glo.cpp:72:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (p == v[0].size()) v[0].pb(t[i]);
~~^~~~~~~~~~~~~~
glo.cpp:74:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if ((p >= v[1].size()) || (v[0][p] < v[1][p])) {
~~^~~~~~~~~~~~~~
glo.cpp:75:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (p >= v[1].size()) v[1].pb(0);
~~^~~~~~~~~~~~~~
glo.cpp:79:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (p == v[1].size()) v[1].pb(t[i]+d);
~~^~~~~~~~~~~~~~
glo.cpp:81:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if ((p >= v[2].size()) || (v[1][p] < v[2][p])) {
~~^~~~~~~~~~~~~~
glo.cpp:82:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (p >= v[2].size()) v[2].pb(0);
~~^~~~~~~~~~~~~~
glo.cpp:86:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (p == v[2].size()) v[2].pb(t[i]);
~~^~~~~~~~~~~~~~
glo.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&x);
~~~~~^~~~~~~~~~~~~~~
glo.cpp:64:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for (i = 0; i < n; i++) scanf("%d",&t[i]);
~~~~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Incorrect |
2 ms |
456 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Incorrect |
2 ms |
456 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Incorrect |
2 ms |
456 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
106 ms |
3204 KB |
Output is correct |
| 2 |
Correct |
86 ms |
5040 KB |
Output is correct |
| 3 |
Correct |
81 ms |
5128 KB |
Output is correct |
| 4 |
Correct |
83 ms |
5128 KB |
Output is correct |
| 5 |
Correct |
54 ms |
6380 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
102 ms |
6380 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2058 ms |
6380 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Incorrect |
2 ms |
456 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
