Hi,
Can someone tell me where this code is failing for FARIDA problem ?
int t, n;
long long ans;
cin >> t;
for(int k=1;k<=t;++k){
cin >> n;
vector<long long> a(n+1, 0);
vector<long long> dp(n+1, 0);
for(int i=1;i<=n;++i) cin >> a[i];
dp[1] = a[1];
dp[2] = a[2];
for(int i=3;i<=n;++i){
dp[i] = max(dp[i-2], dp[i-3]) + a[i];
}
ans = max(dp[n], dp[n-1]);
cout << "Case " << k << ": " << ans << endl;
}