| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 118866 | 陈家宝 | 打家劫舍II | C++ | Accepted | 100 | 0 MS | 240 KB | 284 | 2024-01-02 13:08:39 |
#include<bits/stdc++.h> using namespace std; int n,x,y,a[1001]; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<=n;i++){ if(i%2&&i!=n){ x+=a[i]; x=max(x,y); } else if(i%2==0){ y+=a[i]; y=max(x,y); } } cout<<max(x,y); }