Pagini recente » Cod sursa (job #1695035) | Cod sursa (job #1930691) | Cod sursa (job #1545755) | Cod sursa (job #1763442) | Cod sursa (job #998475)
Cod sursa(job #998475)
#include<fstream>
using namespace std;
ifstream f("bilute.in"); ofstream g("bilute.out");
const int N=30001;
long long s[N],t[N];
int n,i,p=1,C[N],L[N];
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]<<'\n'; g.close(); return 0;
}