A题 link http://codeforces.com/contest/596/problem/A
#include<bits/stdc++.h>
using namespace std;
int v[5][5];
int fab(int a) {
return a > 0 ? a : -a;
}
int fin(int n) {
int ans = -1;
for(int j = 0; j < n; j++) {
for(int i = 0; i < n; i++) {
if(v[i][1] != v[j][1] && v[i][0] != v[j][0]) {
ans = fab(v[i][0] - v[j][0]) * fab(v[i][1] - v[j][1]);
break;
}
}
}
return ans;
}
int main() {
int n;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> v[i][0] >> v[i][1];
}
int ans = fin(n);
cout << ans << endl;
return 0;
}
B题link
http://codeforces.com/contest/596/problem/B
#include<bits/stdc++.h>
using namespace std;
int b[200010];
int fabs(int a)
{
return a>0?a:-a;
}
int main()
{
int n;
__int64 ans=0;
cin>>n;
b[0]=0;
for(int i=1;i<=n;i++)
{
cin>>b[i];
ans+=fabs(b[i]-b[i-1]);
}
cout<<ans<<endl;
return 0;
}
cde待补