Pagini recente » Cod sursa (job #2891681) | Cod sursa (job #196109) | Cod sursa (job #3157017) | Cod sursa (job #141859) | Cod sursa (job #1798935)
#include<fstream>
using namespace std;
ifstream f("bilute.in");
ofstream g("bilute.out");
long long s[1<<15],t[1<<15];
int n,i,p=1,C[1<<15],L[1<<15];
int main()
{
f>>n>>C[1]>>L[1];
s[1]=C[1];
for(i=2;i<=n;++i)
{
f>>C[i]>>L[i];
s[i]=s[i-1]+C[i];
t[1]+=(L[i]+i-1)*C[i];
}
for(i=2;i<=n;++i)
{
t[i]=t[i-1]+C[i-1]*L[i-1]-C[i]*L[i]+2*s[i-1]-s[n];
if(t[i]<t[p]) p=i;
}
g<<p<<' '<<t[p];
return 0;
}