Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
177773 | 任彦恺 | 【C6-11】前缀最大值 | C++ | Wrong Answer | 0 | 1 MS | 252 KB | 260 | 2022-12-10 10:45:20 |
#include<bits/stdc++.h> using namespace std; int n,a[100005],ma=0; int main() { cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } ma=a[1]; for(int i=2;i<=n;i++){ if(a[i-1]<=a[i]){ ma+=a[i]; } else break; } cout<<ma; return 0; }