# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
645309 |
2022-09-26T17:39:24 Z |
notme |
Mean (info1cup19_mean) |
C++14 |
|
0 ms |
304 KB |
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN = 205;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int n, a[MAXN];
int dp[MAXN];
void solve()
{
cin >> n;
for (int i = 1; i <= n; ++ i)
cin >> a[i];
dp[2] = (a[1] + a[2])/2;
for (int i = 3; i <= n; ++ i)
{
dp[i] = max((dp[i-1] + a[i])/2, (dp[i-2] + (a[i-2] + a[i-1])/2)/2);
}
cout << dp[n] << endl;
}
int main()
{
//speed();
solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
304 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
304 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |