URAL 1648 Yachts
2014-09-27 18:43
204 查看
题目链接:点击打开链接
#include<stdio.h> #include<string.h> #include<iostream> #include<algorithm> #include<vector> using namespace std; typedef long long ll; const int N = 20000+10; ll a ; int main() { int n; ll d, sum, ans; while (~scanf("%d%I64d", &n, &d)) { for (int i = 1; i <= n; ++i) scanf("%I64d", &a[i]); sum = 0; for (int i = 1; i <= n; ++i) { sum += a[i]; if (sum > d * i) { a[i] = d * i - (sum - a[i]); sum = d * i; } } printf("%I64d ", sum); ans = sum = 0; if (a > d) ans = sum = a - d; for (int i = n - 1; i >= 1; --i) { if (a[i] <= d) { sum -= d - a[i]; if (sum < 0) sum = 0; ans += sum; } else { a[i] -= d; sum += a[i]; ans += sum; } } printf("%I64d\n", ans); } return 0; }
相关文章推荐
- ural 1648. Yachts 栈
- URAL - 2020 Traffic Jam in Flower Town(模拟)
- POJ 1648 Countryside Highway 笔记
- bzoj1814: Ural 1519 Formula 1
- ural 1014. Product of Digits贪心
- ural 1033. Labyrinth dfs
- zoj 1648 Circuit Board
- 1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐
- URAL - 1004 Sightseeing Trip(最小环)
- ural1143 Electric Path (区间dp)
- Ural 1091. Tmutarakan Exams 容斥原理
- URAL - 2040 Palindromes and Super Abilities 2
- POJ 2352|URAL 1028|Stars|树状数组
- XVII Open Cup named after E.V. Pankratiev. XXI Ural Championship G glassese of solutions
- Freedom of Choice URAL - 1517
- URAL - 1090 树状数组求逆序数
- URAL 1099 Work Scheduling(带花树)
- URAL1519:Formula 1——题解
- Ural 1017 楼梯问题/整数拆分(01背包/dp/母函数)
- URAL1297:Palindrome——题解