http://codeforces.com/problemset/problem/34/A
A
标记1-n个自然数,求min|ai-ai+1|,输出任意一组i和i+1即可
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[111];
while(cin>>n)
{
for(int i=0;i<n;i++)cin>>a[i];
int b[1111];
int max1=0x3f3f3f3f;
int a1,a2;
for(int i=0;i<n-1;i++)
{
if(abs(a[i+1]-a[i])<max1)
{
max1=abs(a[i+1]-a[i]);
a1=i+1,a2=i+2;
}
}
if(abs(a[n-1]-a[0])<max1)
{
max1=abs(a[n-1]-a[0]);
a1=n,a2=1;
}
cout<<a1<<" "<<a2<<endl;
}
return 0;
}
B
http://codeforces.com/problemset/problem/34/B
01背包,只装负数,求和的绝对值最大
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int s;
while(cin>>n>>s)
{
int a[1111];
int js=0;
int dp[1111];
memset(dp,0,sizeof(dp));
int a1;
for(int i=1;i<=n;i++)
{
cin>>a1;
if(a1<=0)
a[js++]=-a1;
}
for(int i=0;i<js;i++)
{
for(int j=s;j>=1;j--)
{
dp[j]=max(dp[j],dp[j-1]+a[i]);
}
}
cout<<dp[s]<<endl;
}
return 0;
}
C
http://codeforces.com/problemset/problem/34/C
找连续的页码,如果连续则输出st-ed 如果是单页则单独输出即可 开个数组记录数字出现的状态
#include<bits/stdc++.h>
using namespace std;
int main(){
bool vis[1111];
memset(vis,0,sizeof(vis));
int a;
cin>>a;
char b;
vis[a]=1;
while(cin>>b>>a)
{
vis[a]=1;
}
int q=0;
int st=1111,ed=1111;
for(int i=0;i<=1000;i++)
{
if(vis[i]==1)
{
if(st==1111)
{
st=i;
}
else {
ed=i;
}
}
else {
if(st==1111)continue;
else {
if(ed==1111)
{
if(q++)cout<<",";
cout<<st;
st=1111;
}
else {
if(q++)cout<<",";
cout<<st<<"-"<<ed;
st=1111,ed=1111;
}
}
}
}
if(st!=1111)
{
if(ed==1111)
{
if(q++)cout<<",";
cout<<st<<endl;
}
else {
if(q++)cout<<",";
cout<<st<<"-"<<ed<<endl;
}
}
return 0;
}
D
http://codeforces.com/problemset/problem/34/D
给一张生成树的图,有一个首都,有一张地图记录除首都以外的点到首都的路线上里这个点最近的一个点,现在要换首都,需要更新地图
bfs
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<queue>
using namespace std;
vector<int>v[50050];
bool vis[50050];
int res[50050];
int n,r,rr;
void bfs()
{
queue<int>que;
que.push(rr);
vis[rr]=1;
while(!que.empty())
{
int now=que.front();
que.pop();
for(int i=0;i<v[now].size();i++)
{
if(vis[v[now][i]]==0)
{
vis[v[now][i]]=1;
res[v[now][i]]=now;
que.push(v[now][i]);
}
}
}
}
int main()
{
int x;
while(~scanf("%d%d%d",&n,&r,&rr))
{
for(int i=0;i<=n;i++)
v[i].clear();
for(int i=1;i<=n;i++)
{
if(i==r)
continue;
scanf("%d",&x);
v[i].push_back(x);
v[x].push_back(i);
}
int p=0;
memset(vis,0,sizeof(vis));
memset(res,0,sizeof(res));
bfs();
for(int i=1;i<=n;i++)
{
if(i==rr)
continue;
if(p++)
cout<<" ";
printf("%d",res[i]);
}
cout<<endl;
}
return 0;
}