Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
int dp[1005][1005]; int lengthOfLongestAP(int A[], int n) { int res = 2; for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { dp[i][j] = 2; } } for(int j = n - 2; j > 0; j--) { int i = j - 1; int k = j + 1; while(i >= 0 and k < n) { if(A[i] + A[k] == 2 * A[j]) { dp[i][j] = dp[j][k] + 1; i--; k++; } else if(A[i] + A[k] < 2 * A[j]) { k++; } else { i--; } } } for(int i= 0; i < n; i++) { for(int j = 0; j < n; j++) { res = max(res, dp[i][j]); } } return res; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
