A:枚举1号的得票数,对于得票数x,2-n号大于x一定得减小到x-1,其它的可减可不减。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll __int64
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m;
#define M 110
#define N 500010
#define Mod 258280327
#define p(x,y) make_pair(x,y)
int a[110];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
while(sf(n)!=EOF){
for(int i=0;i<n;i++) sf(a[i]);
int tmp = a[0];
int ans=0;
for(int i=tmp;i<1010;i++){
int res1=0; //一定得减的
int res2=0; //不一定得减的
for(int j=1;j<n;j++){
if(a[j]>=i){
res1 += (a[j]-i+1);
res2 += (i-1);
}
else
res2 += a[j];
}
if(tmp+res1<=i&&tmp+res1+res2>=i){
ans = i-tmp;
break;
}
}
printf("%d\n",ans);
}
return 0;
}
B:感觉受到了暴击。竟然能这么暴力。。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll __int64
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m;
#define M 110
#define N 500010
#define Mod 258280327
#define p(x,y) make_pair(x,y)
int a[4010][4010];
int deg[4010];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
while(sfd(n,m)!=EOF){
memset(a,0,sizeof a);
memset(deg,0,sizeof deg);
int u,v;
for(int i=0;i<m;i++){
sfd(u,v);
a[u][v]=a[v][u]=1;
deg[u]++;
deg[v]++;
}
int ans=INF;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(a[i][j]){
for(int k=1;k<=n;k++){
if(a[i][k] && a[j][k])
ans = Min(ans,deg[i]+deg[j]+deg[k]-6);
}
}
}
}
if(ans == INF)
printf("-1\n");
else
printf("%d\n",ans);
}
return 0;
}
C:给你n个数,看是否能通过*2,*3使得所有的数都相同。
我们只要计算出它们的gcd,然后使得x=a[i]/gcd,如果x是由2和3的倍数组成的,那么我们肯定能够通过*2,*3使得所有的数都相同。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll __int64
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m;
#define M 110
#define N 500010
#define Mod 258280327
#define p(x,y) make_pair(x,y)
ll a[100010];
bool check(ll x){
while(x&&x%2==0)
x /= 2;
while(x&&x%3==0)
x /= 3;
return (x==1);
}
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
while(sf(n)!=EOF){
ll x;
sfI(a[0]);
x = a[0];
for(int i=1;i<n;i++){
sfI(a[i]);
x = gcd(x,a[i]);
}
// pfI(x);
int flag=1;
for(int i=0;i<n;i++){
ll bs = a[i]/x;
if(!check(bs)){
flag=0;
break;
}
}
if(flag)
printf("Yes\n");
else
printf("No\n");
}
return 0;
}
D:这道题目想法真值得学习。
如果我们直接模拟的话,复杂度可能最大为O(n*n),会超时。
换个角度想,对于某一列i,它的高度为h[i],那么一轮过后,它的高度变为了Min(h[i-1],h[i+1]),那么要消灭某一列,次数就为Min(a[i],a[i-1]+1,a[i+1]+1),其中a[i]为消灭某一列的最少次数,a[0]=1,a[n-1]=1.我们从前往后 以及 从后往前各扫一遍,其中最大的a[i]就是我们要求的次数。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll __int64
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m;
#define M 110
#define N 500010
#define Mod 258280327
#define p(x,y) make_pair(x,y)
int h[100010];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
while(sf(n)!=EOF){
for(int i=0;i<n;i++) sf(h[i]);
h[0]=1;
for(int i=1;i<n;i++)
h[i] = Min(h[i],h[i-1]+1);
h[n-1]=1;
for(int i=n-2;i>=0;i--)
h[i] = Min(h[i],h[i+1]+1);
int ans=0;
for(int i=0;i<n;i++) ans = Max(ans,h[i]);
pf(ans);
}
return 0;
}