Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
45502 | jiabokai | 寻宝石 | C++ | Accepted | 1 MS | 240 KB | 275 | 2024-04-14 19:59:15 |
#include<bits/stdc++.h> using namespace std; int main(){ int n,a[105]; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; } int max=0; for(int i=0;i<n-2;i++){ if((a[i]+(a[i+1])+(a[i+2]))>max){ max=(a[i]+(a[i+1])+(a[i+2])); } } cout<<max; return 0; }