Pagini recente » Cod sursa (job #1668078) | Cod sursa (job #2529966) | Cod sursa (job #821084) | Cod sursa (job #2245880) | Cod sursa (job #2888431)
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
int main()
{
ifstream f("branza.in");
ofstream g("branza.out");
long long n,depozitare,timp,cost,cerere,i,suma;
f >> n >> depozitare >> timp;
auto *preturi = new long long[n+2];
auto *cereri = new long long[n+2];
i = 1;
while (f>>cost>>cerere){
*(preturi+i) = cost;
*(cereri +i) = cerere;
i++;
}
deque<long long>d;
suma = 0;
for(i = 1;i<=n;i++)
{
while (!d.empty() && i-timp > d.back())
d.pop_front();
while (!d.empty() && preturi[i]< (preturi[d.back()]+depozitare*(i-d.back())))
d.pop_back();
d.push_back(i);
suma += cereri[i]*(preturi[d.front()] + depozitare*(i-d.front()));
}
g<<suma;
delete[] cereri;delete[] preturi;
f.close();g.close();
return 0;
}