fork download
copy 
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define int long long
  6. #define ld long double
  7. #define eb emplace_back
  8. #define pb push_back
  9. #define fi first
  10. #define se second
  11. #define nn '\n'
  12. #define pi pair<int, int>
  13. #define unmp unordered_map
  14. #define uns unordered_set
  15. #define lb lower_bound
  16. #define ub upper_bound
  17. #define TASK " "
  18.  
  19. #define FOR(i, a, n) for(int  i =  (a) ; i <= (n) ; i++ )
  20. #define FORD(i, a, n) for(int i = (a); i >= (n); i--)
  21. #define FORX(i, x) for(auto (i) : (x))
  22. #define ms(a, x) memset((a), (x), sizeof((a)))
  23. #define all(a) (a).begin(), (a).end()
  24. #define All(a, n) (a) + 1, (a) + 1 + n
  25.  
  26.  
  27. const int INF = 1e18;
  28. const int mod = 1e9+7;
  29. const int N = 1e6  + 5;
  30. int MOD = 998244353;
  31. int bit[200000];
  32. int n;
  33. int a[N];
  34. int psa[N], psb[N];
  35. void nhap(){
  36.     cin >> n;
  37.     FOR(i, 1, n){
  38.         cin >> a[i];
  39.     }
  40. }
  41. void solve(){
  42.     FOR(i, 1, n){
  43.         psa[i] = psa[i - 1] + a[i];
  44.     }
  45.     FORD(i, n, 1){
  46.         psb[i] = psb[i + 1] + a[i];
  47.     }
  48.     FOR(i, 1, n){
  49.         int kq = ( (i - 1)* a[i] - psa[i - 1] ) + ( psb[i + 1]  - a[i]* (n - i) );
  50.         cout << kq << " ";
  51.     }
  52. }
  53. signed main() {
  54. 	//freopen("CSBN.INP", "r", stdin);
  55. 	//freopen("CSBN.OUT", "w", stdout);
  56. 	ios_base::sync_with_stdio(0);
  57. 	cin.tie(0);
  58. 	cout.tie(0);
  59. 	nhap();
  60. 	solve();
  61.     return 0;
  62. }
Success #stdin #stdout 0.01s 7780KB
comments (?)
stdin
copy 
5
1 2 3 4 5
stdout
copy 
10 7 6 7 10
https://ideone.com/GiALw4
language:
C++14 (gcc 8.3)
created:
5 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!