Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
CodeChef P2 - FIZZA
#include <bits/stdc++.h> using namespace std; void solve(){ int n; cin>>n; int a[n]; for(int i=0;i<n;i++){ cin>>a[i]; } int dp[n]; for(int i=n-1;i>=0;i--){ int ct=0; if(i+1<n){ if(a[i]==a[i+1]){ ct+=(1+dp[i+1]); } } if(i+2<n){ if(a[i]==a[i+2]){ ct+=(1+dp[i+2]); } } dp[i]=ct; } int mx=0; for(int i=0;i<n;i++){ mx=max(mx,dp[i]); } cout<<mx<<"\n"; } int main() { int t; cin>>t; while(t--){ solve(); } }
run
|
edit
|
history
|
help
0
RegexSearch
pangram
RegTokIt
Cpp update 1
Szukanie elementu w niemalejąco posortowanej tablicy używając wyszukiwania binarnego
std_minmax_unexpected_behaviour.cpp
project
NWD
Continuous Sub Set with given sum
How to access member function of a class using scope