fork download
  1. #include<bits/stdc++.h>
  2. #define M 1004
  3. using namespace std;
  4.  
  5. int n, a[M], b[M], dp1[M], dp2[M];
  6.  
  7. int main()
  8. {
  9. ios_base::sync_with_stdio(0);
  10. cin.tie(0); cout.tie(0);
  11.  
  12. cin >> n;
  13. for(int i = 1; i <= n; i++)
  14. cin >> a[i] >> b[i];
  15. dp1[1] = b[1];
  16. dp2[1] = a[1];
  17. for(int i = 2; i <= n; i++)
  18. {
  19. dp1[i] = max(dp1[i - 1] + b[i] + abs(a[i] - a[i - 1]), dp2[i - 1] + b[i] + abs(a[i] - b[i - 1]));
  20. dp2[i] = max(dp2[i - 1] + a[i] + abs(b[i] - b[i - 1]), dp1[i - 1] + a[i] + abs(b[i] - a[i - 1]));
  21. }
  22. cout << max(dp1[n], dp2[n]);
  23. }
  24.  
Success #stdin #stdout 0.01s 5288KB
stdin
5 
2 5 
3 8 
1 10 
7 14 
2 5
stdout
68