fork download
  1. #pragma GCC optimize ("Ofast")
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. template<class S, class T> inline S max_L(S a,T b){
  5. return a>=b?a:b;
  6. }
  7. template<class S, class T> inline S chmax(S &a, T b){
  8. if(a<b){
  9. a=b;
  10. }
  11. return a;
  12. }
  13. #define main dummy_main
  14. int main(){
  15. return 0;
  16. }
  17. #undef main
  18. int dp[20001];
  19. class Solution{
  20. public:
  21. int longestSubsequence(vector<int>& A, int D){
  22. int Lj4PdHRW, i;
  23. int N = A.size();
  24. for(i=(0);i<(N);i++){
  25. A[i] += 10000;
  26. }
  27. for(i=(0);i<(20001);i++){
  28. dp[i] = -1;
  29. }
  30. for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
  31. auto &i = A[Lj4PdHRW];
  32. dp[i] = 1;
  33. if(0 <= i-D && i-D <= 20000){
  34. chmax(dp[i], dp[i-D] + 1);
  35. }
  36. }
  37. {
  38. int KL2GvlyY;
  39. int Q5VJL1cS;
  40. if(20001==0){
  41. Q5VJL1cS = 0;
  42. }
  43. else{
  44. Q5VJL1cS = dp[0];
  45. for(KL2GvlyY=(1);KL2GvlyY<(20001);KL2GvlyY++){
  46. Q5VJL1cS = max_L(Q5VJL1cS, dp[KL2GvlyY]);
  47. }
  48. }
  49. return Q5VJL1cS;
  50. }
  51. }
  52. }
  53. ;
  54. // cLay varsion 20191102-1
  55.  
  56. // --- original code ---
  57. // #define main dummy_main
  58. // {}
  59. // #undef main
  60. //
  61. // int dp[20001];
  62. //
  63. // class Solution {
  64. // public:
  65. // int longestSubsequence(vector<int>& A, int D) {
  66. // int N = A.size();
  67. //
  68. // rep(i,N) A[i] += 1d4;
  69. // rep(i,20001) dp[i] = -1;
  70. //
  71. // rep[A](i,N){
  72. // dp[i] = 1;
  73. // if(0 <= i-D <= 2d4) dp[i] >?= dp[i-D] + 1;
  74. // }
  75. //
  76. // return max(dp(20001));
  77. // }
  78. // };
  79.  
Compilation error #stdin compilation error #stdout 0s 0KB
stdin
Standard input is empty
compilation info
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/8/../../../x86_64-linux-gnu/Scrt1.o: in function `_start':
(.text+0x20): undefined reference to `main'
collect2: error: ld returned 1 exit status
stdout
Standard output is empty