Cod sursa(job #2942865)
| Utilizator | Data | 20 noiembrie 2022 11:20:53 | |
|---|---|---|---|
| Problema | Evaluarea unei expresii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
using namespace std;
int n;
int v[100001];
int st[100001];
int dr[100001];
int main()
{
cin >> n;
for(int i = 1; i <= n; ++i) cin >> v[i];
st[1] = 1;
for(int i = 2; i <= n; ++i)
{
if(v[i] >= v[i - 1])
st[i] = st[i - 1] + 1;
else
st[i] = 1;
}
dr[n] = 1;
for(int i = n - 1; i >= 1; --i)
{
if(v[i] >= v[i + 1])
dr[i] = dr[i + 1] + 1;
else
dr[i] = 1;
}
int s = 0;
for(int i = 1; i <= n; ++i) cout << dr[i] << ' ';
// cout << s;
return 0;
}
